Publication

Latin-Amercian Conference on Combinatorics, Graphs and Applications

Related publications (57)

Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs

It is a long standing open problem to find an explicit description of the stable set polytope of claw-free graphs. Yet more than 20 years after the discovery of a polynomial algorithm for the maximum stable set problem for claw-free graphs, there is even n ...

2004

On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs

Thomas Liebling, Gautier Stauffer

We deal with non-rank facets of the stable set polytope of claw-free graphs. We extend results of Giles and Trotter [7] by (i) showing that for any nonnegative integer a there exists a circulant graph whose stable set polytope has a facet-inducing inequali ...

Springer-Verlag2004

on Non-Rank Facets of the Stable Set Polytope of Claw-Free Graphs and Circulant Graphs

Thomas Liebling, Gautier Stauffer

We deal with non-rank facets of the stable set polytope of claw-free graphs. We extend results of Gilles and Trotter (7) by (i) showing that for any nonnegative integer a there exists a circulant graph whose stable set polytope has a facet-inducing inequal ...

2003

DPS - Dynamic Parallel Schedules

Roger Hersch, Sebastian Gerlach

Dynamic Parallel Schedules (DPS) is a high-level framework for developing parallel applications on distributed memory computers (e.g. clusters of PC). Its model relies on compositional customizable split-compute-merge graphs of operations (directed acyclic ...

IEEE Press2003

Automatic failure-path inference: a generic introspection technique for Internet applications

George Candea

Automatic failure-path inference (AFPI) is an application-generic, automatic technique for dynamically discovering the failure dependency graphs of componentized Internet applications. AFPI's first phase is invasive, and relies on controlled fault injectio ...

2003

Efficient erasure correcting codes

Mohammad Amin Shokrollahi

We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs and analyze the algorithm by analyzing a corresponding discrete-time random process. As a result, we obtain a simple criterion involving the fractio ...

Institute of Electrical and Electronics Engineers2001

On randomized stopping points and perfect graphs

Dominique de Werra, Robert Dalang

Randomized stopping points form a convex set associated with the information structure that arises in the context of the optimal stopping problem for two-parameter processes. We study combinatorial properties of this structure when the underlying space is ...

Elsevier1988

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.