Publications associées à Graphs that Admit Right Angle Crossing Drawings

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Adaptive Majority Problems For Restricted Query Graphs And For Weighted Sets

Abhishek Methuku, Balázs Keszegh

Suppose that the vertices of a graph G are colored with two colors in an unknown way. The color that occurs on more than half of the vertices is called the majority color (if it exists), and any vertex of this color is called a majority vertex. We study th ...

COMENIUS UNIV2019

New Notions and Constructions of Sparsification for Graphs and Hypergraphs

Ola Nils Anders Svensson

A sparsifier of a graph G (Bencztir and Karger; Spielman and Teng) is a sparse weighted subgraph (G) over tilde that approximately retains the same cut structure of G. For general graphs, non-trivial sparsification is possible only by using weighted graphs ...

IEEE COMPUTER SOC2019

On the Rainbow Turan number of paths

Abhishek Methuku

Let F be a fixed graph. The rainbow Turan number of F is defined as the maximum number of edges in a graph on n vertices that has a proper edge-coloring with no rainbow copy of F (i.e., a copy of F all of whose edges have different colours). The systematic ...

ELECTRONIC JOURNAL OF COMBINATORICS2019

Distributed Coloring of Graphs with an Optimal Number of Colors

Etienne Michel François Bamas

This paper studies sufficient conditions to obtain efficient distributed algorithms coloring graphs optimally (i.e. with the minimum number of colors) in the LOCAL model of computation. Most of the work on distributed vertex coloring so far has focused on ...

SCHLOSS DAGSTUHL, LEIBNIZ CENTER INFORMATICS2019

BloomGraph: Graph-Based Exploration of Bouquet Designs for Florist Apprentices

Pierre Dillenbourg, Kevin Gonyop Kim, Catharine Regina Monika Maria Oertel Genannt Bierbach

Exploring design space is an important process in finding solutions to a design task. In this paper, we present BloomGraph, an online application developed for florist apprentices to explore the space of bouquet designs. BloomGraph provides a graph-based i ...

Springer, Cham2019

BloomGraph: Graph-Based Exploration of Bouquet Designs for Florist Apprentices

Pierre Dillenbourg, Kevin Gonyop Kim, Catharine Regina Monika Maria Oertel Genannt Bierbach

SPRINGER INTERNATIONAL PUBLISHING AG2019

Thrackles: An improved upper bound

János Pach, Radoslav Fulek

A thrackle is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are defined similarly, ex ...

ELSEVIER SCIENCE BV2019

Ramsey-Turan numbers for semi-algebraic graphs

János Pach

A semi-algebraic graph G = (V, E) is a graph where the vertices are points in R-d, and the edge set E is defined by a semi-algebraic relation of constant complexity on V. In this note, we establish the following Ramsey-Turan theorem: for every integer p >= ...

ELECTRONIC JOURNAL OF COMBINATORICS2018

Graphs that Admit Right Angle Crossing Drawings

Graph Chatbot

Chattez avec Graph Search

Adaptive Majority Problems For Restricted Query Graphs And For Weighted Sets

Generalized Turan Problems For Even Cycles

Efficient large-scale graph processing: optimisations for storage, performance and evolving graphs

New Notions and Constructions of Sparsification for Graphs and Hypergraphs

On the Rainbow Turan number of paths

Distributed Coloring of Graphs with an Optimal Number of Colors

BloomGraph: Graph-Based Exploration of Bouquet Designs for Florist Apprentices

BloomGraph: Graph-Based Exploration of Bouquet Designs for Florist Apprentices

Thrackles: An improved upper bound

Ramsey-Turan numbers for semi-algebraic graphs

Efficient large-scale graph processing: optimisations for storage, performance and evolving graphs

Generalized Turan Problems For Even Cycles

On the Rainbow Turan number of paths

Adaptive Majority Problems For Restricted Query Graphs And For Weighted Sets

New Notions and Constructions of Sparsification for Graphs and Hypergraphs

Distributed Coloring of Graphs with an Optimal Number of Colors

BloomGraph: Graph-Based Exploration of Bouquet Designs for Florist Apprentices

BloomGraph: Graph-Based Exploration of Bouquet Designs for Florist Apprentices

Thrackles: An improved upper bound

Ramsey-Turan numbers for semi-algebraic graphs