arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2111.00154cs.DM
收藏

完全二部图不平衡问题的刻画

Characterization of the Imbalance Problem on Complete Bipartite Graphs

Steven Ge, Toshiya Itoh

摘要:

研究了完全二部图的不平衡问题。不平衡问题是一个图形布局问题,并且已知是NP完全的。图布局问题在并行计算机体系结构的网络优化、超大规模集成电路设计、信息检索、数值分析、计算生物学、图论、调度和考古学中有着广泛的应用。本文给出了完全二部图上不平衡问题最优解的刻画。利用这些刻画,当给定图的各部分的基数时,我们可以在$\mathcal{O}(\log(|V|) \cdot \log(\log(|V|)))$时间内解决不平衡问题,并在完全二部图上验证给定的解是否在$O(|V|)$时间内是最优的.我们还引入了一个限制形式的真区间二部图,其上的不平衡问题是可解的$\mathcal{O}(c \cdot \log(|V|) \cdot \log(\log(|V|)))$时间,其中$c = \mathcal{O}(|V|)$,通过使用上述特征。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑