scientific article; zbMATH DE number 3648730

zbMATH Open0417.05023MaRDI QIDQ3206972FDOQ3206972

Richard J. Lipton, Robert E. Tarjan

Publication date: 1977

Title of this publication is not available (Why is that?)

zbMATH Keywords

algorithmpartitionplanar graphdivide-and-conquernested dissectionseparator

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cited In (15)

• Graph graphics: Theory and practice
• Improved results on geometric hitting set problems
• Rectilinear short path queries among rectangular obstacles
• Separator theorems and Turán-type results for planar intersection graphs
• Voronoi diagrams from convex hulls
• Storage representations for tree-like data structures
• Geometric Separators for Finite-Element Meshes
• Lower bounds on communication overlap of networks
• A framework for solving VLSI graph layout problems
• Complexities of layouts in three-dimensional VLSI circuits
• Über Separatoren in planaren Graphen
• Title not available (Why is that?)
• Bounds on path connectivity
• Ordered colourings
• On alternation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3206972)