482 search results - page 16 / 97 » A Linear-Time Graph Kernel |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. In this paper, we consider the problem of representing graphs by triangles whose sides touch. We present linear time algorithms for creating touching triangles representa...
WG
2004
Springer
15 years 3 months ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
WADS
2001
Springer
15 years 2 months ago
2001
Springer
We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. Communicated by Giuseppe Liotta ...
91
Voted
ALGORITHMICA
2002
14 years 9 months ago
2002
It is shown that, for every strongly connected network in which every edge has capacity at least , linear time suffices to send flow from source vertices, each with a given supply,...
ESA
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...