ECCC
2010
13 years 10 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
CORR
2004
Springer
13 years 11 months ago
2004
Springer
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a linear-time algorithm that colors optimally the vertices of a Meyniel grap...
DAM
2007
13 years 11 months ago
2007
We study a many-to-many generalisation of the well-known stable roommates problem in which each participant seeks to be matched with a number of others. We present a linear-time a...
COLOGNETWENTE
2009
14 years 16 days ago
2009
: Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold g...
GD
2001
Springer
14 years 3 months ago
2001
Springer
Abstract. We present a simple, linear-time algorithm to determine horizontal coordinates in layered layouts subject to a given ordering within each layer. The algorithm is easy to ...
RECOMB
2005
Springer
14 years 11 months ago
2005
Springer
