Abstract
We study the imbalance problem on complete bipartite graphs. The imbalance problem is a graph layout problem and is known to be NP-complete. Graph layout problems find their applications in the optimization of networks for parallel computer architectures, VLSI circuit design, information retrieval, numerical analysis, computational biology, graph theory, scheduling and archaeology [2]. In this paper, we give characterizations for the optimal solutions of the imbalance problem on complete bipartite graphs. Using the characterizations, we can solve the imbalance problem in time polylogarithmic in the number of vertices, when given the cardinalities of the parts of the graph, and verify whether a given solution is optimal in time linear in the number of vertices on complete bipartite graphs. We also introduce a generalized form of complete bipartite graphs on which the imbalance problem is solvable in time quasilinear in the number of vertices by using the aforementioned characterizations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
The proofs marked with an * are provided in detail in the full version of the paper.
References
Biedl, T., Chan, T., Ganjali, Y., Hajiaghayi, M.T., Wood, D.R.: Balanced vertex-orderings of graphs. Discrete Appl. Math. 148(1), 27–48 (2005). https://doi.org/10.1016/j.dam.2004.12.001, http://www.sciencedirect.com/science/article/pii/S0166218X04003828
Díaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Surv. (CSUR) 34(3), 313–356 (2002)
Gorzny, J.: Computing imbalance-minimal orderings for bipartite permutation graphs and threshold graphs. In: Wu, W., Zhang, Z. (eds.) COCOA 2020. LNCS, vol. 12577, pp. 766–779. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-64843-5_52
Gorzny, J., Buss, J.F.: Imbalance, cutwidth, and the structure of optimal orderings. In: Du, D.-Z., Duan, Z., Tian, C. (eds.) COCOON 2019. LNCS, vol. 11653, pp. 219–231. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-26176-4_18
Harvey, D., van der Hoeven, J.: Integer multiplication in time o(n log n). Ann. Math. 193(2), 563–617 (2021). https://www.jstor.org/stable/10.4007/annals.2021.193.2.4
Kára, J., Kratochvíl, J., Wood, D.R.: On the complexity of the balanced vertex ordering problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 849–858. Springer, Heidelberg (2005). https://doi.org/10.1007/11533719_86
Wood, D.: Minimising the number of bends and volume in three-dimensional orthogonal graph drawings with a diagonal vertex layout. Algorithmica (New York) 39 (2002). https://doi.org/10.1007/s00453-004-1091-4
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Ge, S., Itoh, T. (2022). Characterization of the Imbalance Problem on Complete Bipartite Graphs. In: Du, DZ., Du, D., Wu, C., Xu, D. (eds) Theory and Applications of Models of Computation. TAMC 2022. Lecture Notes in Computer Science, vol 13571. Springer, Cham. https://doi.org/10.1007/978-3-031-20350-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-031-20350-3_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-20349-7
Online ISBN: 978-3-031-20350-3
eBook Packages: Computer ScienceComputer Science (R0)