Characterization of the imbalance problem on complete bipartite graphs

DOI10.1007/978-3-031-20350-3_6arXiv2111.00154OpenAlexW4313349633MaRDI QIDQ6111943

Toshiya Itoh, Steven Ge

Publication date: 4 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.00154

zbMATH Keywords

complete bipartite graphimbalance problemvertex layoutproper interval bipartite graph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Balanced vertex-orderings of graphs
• Imbalance, cutwidth, and the structure of optimal orderings
• Integer multiplication in time \(O(n\log n)\)
• Computing imbalance-minimal orderings for bipartite permutation graphs and threshold graphs
• Computing and Combinatorics

This page was built for publication: Characterization of the imbalance problem on complete bipartite graphs