Long Local Searches for Maximal Bipartite Subgraphs

DOI10.1137/060666615zbMath1229.05147OpenAlexW2032378868MaRDI QIDQ3394991

Hemanshu Kaul, Douglas B. West

Publication date: 20 August 2009

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/23563cccf4de7330ca13a2fd28feb699c9690b2f

zbMATH Keywords

hill-climbing algorithmlocal switchingMAX-CUT problemlarge bipartite subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Long Local Searches for Maximal Bipartite Subgraphs