12015 search results - page 2017 / 2403 » Interactive Algorithms 2005 |
168
click to vote
ISAAC
2005
Springer
16 years 8 days ago
2005
Springer
This paper investigates the complexity of the min-max and min-max regret versions of the s−t min cut and min cut problems. Even if the underlying problems are closely related and...
146
click to vote
ISAAC
2005
Springer
16 years 8 days ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
191
click to vote
ISAAC
2005
Springer
16 years 8 days ago
2005
Springer
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...
162
click to vote
ISAAC
2005
Springer
16 years 8 days ago
2005
Springer
A graph G is δ-hyperbolic if for any four vertices u, v, x, y of G the two larger of the three distance sums dG(u, v) + dG(x, y), dG(u, x) + dG(v, y), dG(u, y) + dG(v, x) differ b...
152
click to vote
ISAAC
2005
Springer
16 years 8 days ago
2005
Springer
We study how to label the vertices of a tree in such a way that we can decide the distance of two vertices in the tree given only their labels. For trees, Gavoille et al. [7] prove...