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. 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 $\mathcal{O}(\log(|V|) \cdot \log(\log(|V|)))$ time, when given the cardinalities of the parts of the graph, and verify whether a given solution is optimal in $O(|V|)$ time on complete bipartite graphs. We also introduce a restricted form of proper interval bipartite graphs on which the imbalance problem is solvable in $\mathcal{O}(c \cdot \log(|V|) \cdot \log(\log(|V|)))$ time, where $c = \mathcal{O}(|V|)$, by using the aforementioned characterizations.
Interval colorings of complete bipartite graphs and trees
从俄语翻译的工作R.R. Kamalian“Interval colorings of complete bipartite graphs and trees”,Preprint of the Computing Centre of the Academy of Sciences of Armenia,Yerevan,1989。(Was亚美尼亚苏维埃社会主义共和国科学院计算中心学术委员会和埃里温国立大学决定于1989年9月7日公布)。
A complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter
在图中,匹配割是匹配的边割。匹配割是判定给定图是否有匹配割的问题,即使仅限于二分图,也是NP完全的。证明了直径为2的图的匹配割是多项式可解的。本文证明了对任意固定的整数$d\ge 3$,匹配割在直径为$d$的图类中是NP-完全的.这解决了Borowiecki和Jesse-Józefczyk在[Matching cutsets in graphs of diameter $2$,Theoretical计算机科学407(2008)574-582]中提出的公开问题。然后,我们表明,对于任何固定的整数$d\ge 4$,匹配割是NP-完全的,即使限制在类的二部图的直径$d$。作为对硬度结果的补充,我们证明了匹配割在直径不超过3的二部图类中是多项式时间可解的,并提出了一种新的求解直径为$2$的图类中匹配割的简单多项式时间算法.