Local bipartite turán graphs and graph partitioning

DOI10.1002/net.3230240302zbMath0801.90118OpenAlexW1993132477MaRDI QIDQ4291487

Jennifer K. Ryan, Jon Lee

Publication date: 10 May 1994

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230240302

zbMATH Keywords

heuristicLagrangian boundbipartite Turán graphsmeasures of nonbipartitenessminimum-weight balanced bipartition

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• An Efficient Heuristic Procedure for Partitioning Graphs

This page was built for publication: Local bipartite turán graphs and graph partitioning