15 search results - page 1 / 3 » A Linear Time Algorithm for Finding a Maximal Planar Subgrap... |
ISAAC
1995
Springer
13 years 9 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
COCOON
2005
Springer
13 years 11 months ago
2005
Springer
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
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
SIAMCOMP
1998
13 years 5 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...