A Heuristic Algorithm for Small Separators in Arbitrary Graphs

DOI10.1137/0219018zbMath0697.68046OpenAlexW1993946385MaRDI QIDQ3474888

David Alan Plaisted

Publication date: 1990

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0219018

zbMATH Keywords

flows in networksrandom algorithmsseparators in graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (05C99) Algorithms in computer science (68W99)

Related Items (4)

Genetic search algorithms and their randomized operators ⋮ Genetic algorithm based heuristics for the mapping problem ⋮ An approximate max-flow min-cut relation for undirected multicommodity flow, with applications ⋮ Finding good approximate vertex and edge partitions is NP-hard

This page was built for publication: A Heuristic Algorithm for Small Separators in Arbitrary Graphs