Maintaining biconnected components of dynamic planar graphs

This publication has 17 references indexed in Scilit:

• Incremental algorithms for minimal length paths
  Journal of Algorithms, 1991
• Fully dynamic algorithms for edge connectivity problems
  Published by Association for Computing Machinery (ACM) ,1991
• Incremental planarity testing
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• Finding paths and deleting edges in directed acyclic graphs
  Information Processing Letters, 1988
• Maintenance of transitive closures and transitive reductions of graphs
  Lecture Notes in Computer Science, 1988
• Fully dynamic techniques for point location and transitive closure in planar structures
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• Amortized efficiency of a path retrieval data structure
  Theoretical Computer Science, 1986
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
  SIAM Journal on Computing, 1985
• An On-Line Edge-Deletion Problem
  Journal of the ACM, 1981
• GRAPH THEORY
  Published by Defense Technical Information Center (DTIC) ,1969