1736 search results - page 19 / 348 » The rank-width of Directed Graphs |
GBRPR
2009
Springer
14 years 8 months ago
2009
Springer
In this paper, we present a novel graph construction method and demonstrate its usage in a broad range of applications starting from a relatively simple single-surface segmentation...
120
Voted
SODA
2012
ACM
13 years 17 days ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
DAM
2010
14 years 8 months ago
2010
We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted...
112
click to vote
IEICET
2011
14 years 5 months ago
2011
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
91
Voted
RP
2010
Springer
14 years 8 months ago
2010
Springer
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...