scientific article; zbMATH DE number 867693

MaRDI QIDQ4873809zbMATH OpenFDO

Authors Fan Chung

Publication date 22 April 1996

zbMATH Keywords

boundsplanar graphplanar separator

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 1979709
• scientific article; zbMATH DE number 4064516
• scientific article; zbMATH DE number 4091555
• Space efficient separator algorithms for planar graphs
• \(N\)-separators in planar graphs
• Edge Separators of Planar and Outerplanar Graphs With Applications
• Graph separators, with applications
• On the path separability of planar graphs
• scientific article; zbMATH DE number 2119685
• Short and simple cycle separators in planar graphs

Cited in

(21)

• Finding small simple cycle separators for 2-connected planar graphs
• Asymptotic component densities in programmable gate arrays realizing all circuits of a given size
• Partitioning planar graphs with vertex costs: Algorithms and applications
• Reduced constants for simple cycle graph separation
• On 3-pushdown graphs with large separators
• On the path separability of planar graphs
• scientific article; zbMATH DE number 4155924 (Why is no real title available?)
• Partitioning planar graphs with costs and weights
• scientific article; zbMATH DE number 4064516 (Why is no real title available?)
• scientific article; zbMATH DE number 4091555 (Why is no real title available?)
• scientific article; zbMATH DE number 4101213 (Why is no real title available?)
• A Separator Theorem for Nonplanar Graphs
• Edge Separators of Planar and Outerplanar Graphs With Applications
• Finding Separator Cuts in Planar Graphs within Twice the Optimal
• Planar Separators
• scientific article; zbMATH DE number 1979709 (Why is no real title available?)
• scientific article; zbMATH DE number 1501958 (Why is no real title available?)
• scientific article; zbMATH DE number 1926663 (Why is no real title available?)
• \(N\)-separators in planar graphs
• Space efficient separator algorithms for planar graphs
• On cleaving a planar graph

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 Q4873809)