Concept

Interval graph

Related publications (26)

On coloring problems with local constraints

We deal with some generalizations of the graph coloring problem on classes of perfect graphs. Namely we consider the μ-coloring problem (upper bounds for the color on each vertex), the precoloring extension problem (a subset of vertices colored beforehand) ...

Elsevier2012

Coloring K-k-free intersection graphs of geometric objects in the plane

János Pach

The intersection graph of a collection C of sets is the graph on the vertex set C, in which C-1 . C-2 is an element of C are joined by an edge if and only if C-1 boolean AND C-2 not equal empty set. Erdos conjectured that the chromatic number of triangle-f ...

2012

Precise Measurement of the CP Violation Parameter sin2 phi(1) in B-0 -> (c(c)over-bar) K-0 Decays

Olivier Schneider, Yiming Li, Aurelio Bay, Mingkui Wang, Chao Wang, Tagir Aushev, Jun Yong Kim, Remi Léandre Albert Louvot, Ji Hyun Kim, Jing Li

We present a precise measurement of the CP violation parameter sin2 phi(1) and the direct CP violation parameter A(f) using the final data sample of 772 x 10(6) B (B) over bar pairs collected at the gamma(4S) resonance with the Belle detector at the KEKB a ...

2012

Vision-Based Scene Understanding with Sparsity Promoting Priors

Alexandre Massoud Alahi

Human beings are interested in understanding their environments and the dynamic content that fills their surroundings. For applications ranging from security to marketing, people have installed networks of cameras to capture the dynamic elements of scenes. ...

EPFL2011

Network Design via Core Detouring for Problems Without a Core

Thomas Rothvoss

Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nodes to a random subset of them. In a recent work [Eisenbrand,Grandoni,Rothvo\ ...

Springer2010

Conflict-free colorings of graphs and hypergraphs Probability and Computing

János Pach, Gábor Tardos

A colouring of the vertices of a hypergraph H is called conflict-free if each hyperedge E of H contains a vertex of 'unique' colour that does not get repeated in E. The smallest number of colours required for such a colouring is called the conflict-free ch ...

Cambridge University Press2009

Coloring Fuzzy Circular Interval Graphs

Friedrich Eisenbrand, Martin Niemeier

Computing the weighted coloring number of graphs is a classical topic in combinatorics and graph theory. Recently these problems have again attracted a lot of attention for the class of quasi-line graphs and more specifically fuzzy circular interval graphs ...

Elsevier2009

Evidence of time-dependent CP violation in the decay B^{0}→D^{+}D^{-}

Olivier Schneider, Aurelio Bay, Chao Wang, Tagir Aushev, Vladislav Balagura, Jean Wicht, Remi Léandre Albert Louvot, Nicolas Zwahlen, Jing Li

We report a measurement of the CP-odd fraction and the time-dependent CP violation in B-0 -> D*+D*- decays, using 657x10(6) BB events collected at the Upsilon(4S) resonance with the Belle detector at the KEKB asymmetric-energy e(+)e(-) collider. We measure ...

2009

On a graph coloring problem arising from discrete tomography

Dominique de Werra, Bernard Ries

An extension of the basic image reconstruction problem in discrete tomography is considered: given a graph

G=(V,E)

and a family

\mathcal{P}

of chains

P_i

together with vectors

h(P_i)=(h_{i}^{1},...,h_{i}^{k})

, one wants to find a partition $V^{1},. ...

2008

Atrial repolarization as observable in the PQ interval

Zenichi Ihara

Objective: To study the involvement of atrial repolarization in body surface potentials. Methods: Electrocardiograms of healthy subjects were recorded using a 64-lead system. The data analysis focused on the PQ intervals, while devoting special attention t ...

2006

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.