Sciweavers

ISAAC
2009
Springer
95views Algorithms» more  ISAAC 2009»
13 years 11 months ago
Bandwidth on AT-Free Graphs
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch,...
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
13 years 11 months ago
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Core...
ISAAC
2009
Springer
109views Algorithms» more  ISAAC 2009»
13 years 11 months ago
A Linear Vertex Kernel for Maximum Internal Spanning Tree
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, St&e...
ISAAC
2009
Springer
84views Algorithms» more  ISAAC 2009»
13 years 11 months ago
Editing Graphs into Disjoint Unions of Dense Clusters
Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Jo...