268 search results - page 20 / 54 » Cleaning Interval Graphs |
COMBINATORICA
2008
14 years 10 months ago
2008
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
85
Voted
APPINF
2003
14 years 11 months ago
2003
In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...
74
Voted
TR
2008
14 years 10 months ago
2008
The failure probability of a product F(t) and the life time quantile tp are commonly used metrics in reliability applications. Confidence intervals are used to quantify the statis...
PPOPP
2005
ACM
15 years 3 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
WG
2007
Springer
15 years 4 months ago
2007
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, t...