59 search results - page 2 / 12 » A Linear Time Algorithm For Finding Maximal Planar Subgraphs |
SOFSEM
2010
Springer
14 years 2 months ago
2010
Springer
ESA
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
COLOGNETWENTE
2009
13 years 6 months ago
2009
: Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold g...
GD
2009
Springer
13 years 10 months ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
APPINF
2003
13 years 6 months ago
2003
In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...