1736 search results - page 1 / 348 » The rank-width of Directed Graphs |
WG
2009
Springer
13 years 9 months ago
2009
Springer
SIAMDM
2008
13 years 4 months ago
2008
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
WG
2007
Springer
13 years 11 months ago
2007
Springer
IWOCA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
WG
2010
Springer
13 years 2 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...