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

定向图以优化可达性

Orienting Graphs to Optimize Reachability

S. L. Hakimi, E. Schmeichel, Neal E. Young

摘要:

本文主要研究两个问题:(i)如何对无向图的边进行定向,以使有序顶点对(x,y)的数目最大化,使得从x到y有一条有向路;(ii)如何对边进行定向,以使有序顶点对的数目最小化。本文描述了第一个问题的二次时间算法,并证明了第二个问题是NP-难的,在某个常数1+ n> 1内近似。后一个证明还表明,第二个问题等价于“可比性图完备化”;这两个问题以前都不是NP困难的。

英文摘要:

The paper focuses on two problems: (i) how to orient the edges of an undirected graph in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y, and (ii) how to orient the edges so as to minimize the number of such pairs. The paper describes a quadratic-time algorithm for the first problem, and a proof that the second problem is NP-hard to approximate within some constant 1+epsilon > 1. The latter proof also shows that the second problem is equivalent to ``comparability graph completion''; neither problem was previously known to be NP-hard.

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

↑