244 search results - page 22 / 49 » Intervalizing k-Colored Graphs |
117
Voted
FAW
2009
Springer
15 years 9 months ago
2009
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the PATHWIDTH problem is NP-hard for parti...
121
Voted
SODA
2008
ACM
15 years 4 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
112
click to vote
COMBINATORICA
2008
15 years 2 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...
124
Voted
APPINF
2003
15 years 4 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...
116
Voted
TR
2008
15 years 2 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...