1736 search results - page 115 / 348 » The rank-width of Directed Graphs |
126
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
124
click to vote
EDBTW
2010
Springer
15 years 11 months ago
2010
Springer
Graph composition has applications in a variety of practical applications. In drug development, for instance, in order to understand possible drug interactions, one has to merge k...
129
click to vote
CSE
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph t...
121
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
State space techniques have proven to be useful for measuring and improving the coverage of test vectors that are used during functional validation via simulation. By comparing th...
129
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...