O(m log n)-time algorithm for the maximal planar subgraph problem

SIAM Journal on Computing

Volumn 22, Issue 6, 1993, Pages 1142-1162

  Cai, Jiazhen ^a   Han, Xiaofeng ^a   Tarjan, Robert E ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; LINEAR ALGEBRA; TREES (MATHEMATICS);

COMPLEXITY; DEPTH-FIRST-SEARCH; EMBEDDING; LINEAR EQUATIONS; PLANAR GRAPH; SELECTION TREE;

ALGORITHMS;

EID: 0027829965     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/0222068     Document Type: Article

References (15)