Weighted graph separators and their applications

DOI10.1007/3-540-63397-9_11zbMATH Open1479.05074OpenAlexW1579591345MaRDI QIDQ826080FDOQ826080

Authors: Hristo N. Djidjev 

Publication date: 20 December 2021

Full work available at URL: https://doi.org/10.1007/3-540-63397-9_11

Recommendations

• Partitioning planar graphs with vertex costs: Algorithms and applications
• Separators in graphs with negative and multiple vertex weights
• scientific article; zbMATH DE number 4064516
• Planar Separators
• Partitioning planar graphs with costs and weights

zbMATH Keywords

planar graphspanning treebinary treechordal graphseparator theorem

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Flows in graphs (05C21) Signed and weighted graphs (05C22)

Cited In (13)

• Partitioning planar graphs with costs and weights
• Improved Approximation Algorithms for Minimum Weight Vertex Separators
• \(N\)-separators in planar graphs
• Object location using path separators
• Title not available (Why is that?)
• Title not available (Why is that?)
• On weighted sublinear separators
• NP-completeness of the Planar Separator Problems
• Title not available (Why is that?)
• Graph separators, with applications
• On cleaving a planar graph
• Planar Separators
• A near optimal algorithm for edge separators (preliminary version)

This page was built for publication: Weighted graph separators and their applications

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