部分定向图的完全定向
Completing orientations of partially oriented graphs
摘要:
我们开始了一个一般性的研究,我们称之为定向完成问题。对于一个固定的有向图类C,定向完备化问题是问一个给定的部分有向图P是否可以通过对P中的(非定向)边进行定向而被完备化为C中的有向图。定向完备化问题通常概括了几个现有的问题,包括某些图类和有向图的识别以及某些几何可表示图的扩展表示。本文研究了各类定向图的定向完成问题,包括k-弧强定向图、k-强定向图、拟传递定向图、局部竞赛图、非循环局部竞赛图、局部传递竞赛图、局部传递局部竞赛图、内竞赛图以及具有定向圈因子的定向图.我们表明,这些类的方向完成问题是多项式时间可解或NP-完全。我们还表明,一些NP完全问题成为多项式时间可解的输入导向图满足一定的额外条件。我们的结果意味着真区间图和真圆弧图的表示扩张问题是多项式时间可解的,推广了以前的一个结果。
英文摘要:
We initiate a general study of what we call orientation completion problems. For a fixed class C of oriented graphs, the orientation completion problem asks whether a given partially oriented graph P can be completed to an oriented graph in C by orienting the (non-oriented) edges in P. Orien- tation completion problems commonly generalize several existing problems including recognition of certain classes of graphs and digraphs as well as extending representations of certain geometrically representable graphs. We study orientation completion problems for various classes of oriented graphs, including k-arc- strong oriented graphs, k-strong oriented graphs, quasi-transitive oriented graphs, local tournament, acyclic local tournaments, locally transitive tournaments, locally transitive local tournaments, in- tournaments, and oriented graphs which have directed cycle factors. We show that the orientation completion problem for each of these classes is either polynomial time solvable or NP-complete. We also show that some of the NP-complete problems become polynomial time solvable when the input oriented graphs satisfy certain extra conditions. Our results imply that the representation extension problems for proper interval graphs and for proper circular arc graphs are polynomial time solvable, which generalize a previous result.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。