Publication

Minimum d-blockers and d-transversals in graphs

Related publications (83)

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.

Circular Ones Matrices and the Stable set Polytopes of Quasi-Line Graphs

Friedrich Eisenbrand, Gautier Stauffer

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 ...

2005

On the stable set polytope of claw-free graphs

Gautier Stauffer

In this thesis we focus our attention on the stable set polytope of claw-free graphs. This problem has been open for many years and albeit all the efforts engaged during those last three years, it is still open. This does not mean that no progress has been ...

EPFL2005

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

Friedrich Eisenbrand, Gautier Stauffer

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

A computational framework for the discovery of novel biotransformations

Vassily Hatzimanikatis

The large no. of chem. transformations involved in biochem. pathways and the even larger no. of enzymes that catalyze these transformations contribute to the complexity of biol. systems. Anal. of the available genome sequences, as well as results from prio ...

2003

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

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

Faster Shortest-Path Algorithms for Planar Graphs

Monika Henzinger

We give a linear-time algorithm for single-source shortest paths in planar graphs with nonnegative edge-lengths. Our algorithm also yields a linear-time algorithm for maximum flow in a planar graph with the source and sink on the same face. For the case wh ...

1997

Finding all the perfect matchings in bipartite graphs

This paper describes an algorithm for finding all the perfect matchings in a bipartite graph. By using the binary partitioning method, our algorithm requires O(c(n+m)+n^2.5) computational effort and O(nm) memmory storage, (where n denotes the number of ver ...

1994

A note on order preserving matchings

Thomas Liebling, François Margot

We study order preserving injections or bipartite matchings from poset V1 to poset V2. When V1 is totally ordered, we give an efficient algorithm for the associated optimization problem and the convex hull of the corresponding characteristic vectors. If V2 ...

1989