482 search results - page 21 / 97 » A Linear-Time Graph Kernel |
161
click to vote
GD
2005
Springer
15 years 12 months ago
2005
Springer
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
133
click to vote
GD
2001
Springer
15 years 11 months ago
2001
Springer
We give a characterization of DFS cotree-critical graphs which is central to the linear time Kuratowski finding algorithm implemented in PIGALE (Public Implementation of a Graph ...
151
click to vote
JGAA
2008
15 years 6 months ago
2008
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
147
click to vote
GD
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. A graph is planar if and only if it does not contain a Kuratowski subdivision. Hence such a subdivision can be used as a witness for non-planarity. Modern planarity testi...
168
click to vote
ISAAC
1992
Springer
15 years 10 months ago
1992
Springer
A (0,1)-matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueke...