Separators in graphs with negative and multiple vertex weights

DOI10.1007/PL00009250MaRDI QIDQ1277323zbMATH OpenOpenAlexFDO

Authors K. Appert, Hristo N. Djidjev, J. R. Gilbert

Publication date 2 February 1999

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00009250

zbMATH Keywords

separator theorem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Weighted graph separators and their applications
• scientific article; zbMATH DE number 1979709
• Planar Separators
• Partitioning planar graphs with costs and weights
• Partitioning planar graphs with costs and weights

Cited in

(6)

• Minimum vertex cover in ball graphs through local search
• Solving the weighted k-separator problem in graphs with specific modules
• Recursive conditioning
• Multiphase mesh partitioning
• Weighted graph separators and their applications
• Spectral partitioning works: planar graphs and finite element meshes

This page was built for publication: Separators in graphs with negative and multiple vertex weights

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