Concept

Graph coloring

Related publications (321)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Graph-Constrained Group Testing

Amin Karbasi, Mahdi Cheraghchi Bashi Astaneh, Soheil Mohajerzefreh

Non-adaptive group testing involves grouping arbitrary subsets of

n

items into different pools. Each pool is then tested and defective items are identified. A fundamental question involves minimizing the number of pools required to identify at most

d

d ...

2012

Cohomology of GKM fiber bundles

Silvia Sabatini

The equivariant cohomology ring of a GKM manifold is isomorphic to the cohomology ring of its GKM graph. In this paper we explore the implications of this fact for equivariant fiber bundles for which the total space and the base space are both GKM and deri ...

Springer Verlag2012

A Large-Scale Multi-Lingual Color Thesaurus

Sabine Süsstrunk, Albrecht Johannes Lindner, Bryan Zhi Li

We present a color thesaurus with over 9000 color names in ten different languages. Instead of using conventional psychophysical experiments, we use a statistical framework that is based on search results from Google Image Search. For each color name we co ...

2012

A survey of stochastic omega-regular games

We summarize classical and recent results about two-player games played on graphs with omega-regular objectives. These games have applications in the verification and synthesis of reactive systems. Important distinctions are whether a graph game is turn-ba ...

2012

Universal Sets for Straight-Line Embeddings of Bicolored Graphs

Jan Kyncl

A set S of n points is 2-color universal for a graph G on n vertices if for every proper 2-coloring of G and for every 2-coloring of S with the same sizes of color classes as G has, G is straight-line embeddable on S. We show that the so-called double chai ...

2011

Every graph admits an unambiguous bold drawing

János Pach

Let r and w be a fixed positive numbers, w < r. In a bold drawing of a graph, every vertex is represented by a disk of radius r, and every edge by a narrow rectangle of width w. We solve a problem of van Kreveld [K09] by showing that every graph admits a b ...

Springer-Verlag Berlin2011

Beyond Graphs: A New Synthesis

Dario Floreano, Claudio Mattiussi, Daniel Marbach, Peter Dürr

Artiﬁcial neural networks, electronic circuits, and gene networks are some examples of systems that can be modeled as networks, that is, as collections of interconnected nodes. In this paper we introduce the concept of terminal graph (t-graph for short), w ...

2011

Network community-detection enhancement by proper weighting

Martin Hasler, Ali Ajdari Rad, Alireza Khadivi

In this article, we show how proper assignment of weights to the edges of a complex network can enhance the detection of communities and how it can circumvent the resolution limit and the extreme degeneracy problems associated with modularity. Our general ...

American Physical Society2011

A PTAS for the Highway Problem

Thomas Rothvoss

In the highway problem, we are given an n-edge line graph (the highway), and a set of paths (the drivers), each one with its own budget. For a given assignment of edge weights (the tolls), the highway owner collects from each driver the weight of the assoc ...

2011

Extraction of network topology from multi-electrode recordings: is there a small-world effect?

Wulfram Gerstner, Joao Emanuel Felipe Gerhard

The simultaneous recording of the activity of many neurons poses challenges for multivariate data analysis. Here, we propose a general scheme of reconstruction of the functional network from spike train recordings. Effective, causal interactions are estima ...

Frontiers Research Foundation2011

Graph-Constrained Group Testing

Amin Karbasi, Mahdi Cheraghchi Bashi Astaneh, Soheil Mohajerzefreh

Non-adaptive group testing involves grouping arbitrary subsets of

n

items into different pools. Each pool is then tested and defective items are identified. A fundamental question involves minimizing the number of pools required to identify at most

d

d ...

2012