SIAM Digital Library
 
 
 

You are not logged in Logged Out Log In

SIAM J. on Discrete Mathematics / Volume 20 / Issue 2

SIAM J. Discrete Math. 20, pp. 444-462 (19 pages)

A Linear-Time Algorithm for Finding a Maximal Planar Subgraph

Hristo N. Djidjev

Full Text: Download PDF | Buy PDF (US$25) | View Cart
We construct an optimal linear-time algorithm for the maximal planar subgraph problem: given a graph G, find a planar subgraph G' of G such that adding to G' an extra edge of G results in a nonplanar graph. Our solution is based on a fast data structure for incremental planarity testing of triconnected graphs and a dynamic graph search procedure. Our algorithm can be transformed into a new optimal planarity testing algorithm.

© 2006 Society for Industrial and Applied Mathematics

RELATED DATABASES

To view database links for this article, you need to log in.

KEYWORDS

AMS Subject Headings

05C10, 05C85, 68R10, 68Q25, 68W40

PUBLICATION DATA

ISSN

0895-4801 (print)  
1095-7146 (online)

Publisher

$abstract.society.value is a Member of CrossRef Society for Industrial and Applied Mathematics

ARTICLE DATA

Digital Object Identifier
http://dx.doi.org/10.1137/S0895480197328771

For access to fully linked references, you need to log in.

For access to citing articles, you need to log in.


Close

Your Recent History Recent History Help

Recently Viewed

  1. A Linear-Time Algorithm for Finding a Maximal Planar Subgraph
  2. Mean Field Games: Numerical Methods for the Planning Problem
  3. A Convex Condition for Robust Stability Analysis via Polyhedral Lyapunov Functions
  4. Stability and Resolution Analysis for a Topological Derivative Based Imaging Functional
  5. Experimental Design for Biological Systems
© SIAM By using SIAM Publications Online you agree to abide by the Terms and Conditions of Use. Banner art adapted from a figure by Hinke M. Osinga and Bernd Krauskopf (University of Bristol, UK).
close