1105 search results - page 6 / 221 » Linear choosability of graphs |
117
click to vote
WG
2010
Springer
15 years 1 months ago
2010
Springer
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...
103
click to vote
COMBINATORICA
2008
15 years 3 months ago
2008
We prove that any H-minor-free graph, for a fixed graph H, of treewidth w has an (w)
157
click to vote
CVPR
2012
IEEE
13 years 5 months ago
2012
IEEE
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
139
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
125
click to vote
WG
2010
Springer
15 years 1 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...