Edge Separators of Planar and Outerplanar Graphs With Applications
From MaRDI portal
Publication:4033768
DOI10.1006/jagm.1993.1013zbMath0764.68112OpenAlexW2049142782MaRDI QIDQ4033768
Krzystof Diks, Hristo N. Djidjev, Imrich Vrt'o, Ondrej Sýkora
Publication date: 16 May 1993
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1993.1013
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (19)
Optimal algorithms for broadcast and gossip in the edge-disjoint path modes ⋮ Optimal algorithms for broadcast and gossip in the edge-disjoint modes ⋮ Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs ⋮ Fast balanced partitioning is hard even on grids and trees ⋮ Modularity of minor‐free graphs ⋮ Planarization of graphs embedded on surfaces ⋮ Edge separators for graphs excluding a minor ⋮ Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area ⋮ A note on isoperimetric peaks of complete trees ⋮ An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs ⋮ On the design of efficient ATM routing schemes ⋮ Drawing Planar Graphs with Reduced Height ⋮ Covering nearly surface-embedded graphs with a fixed number of balls ⋮ BOUNDARY-OPTIMAL TRIANGULATION FLOODING ⋮ Edge integrity of nearest neighbor graphs and separator theorems ⋮ Generating irregular partitionable data structures ⋮ On the complexity of multi-dimensional interval routing schemes ⋮ An external memory data structure for shortest path queries ⋮ Wavelength routing in optical networks of diameter two
This page was built for publication: Edge Separators of Planar and Outerplanar Graphs With Applications
