arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1810.06162cs.DM
收藏

调整区间有向图的识别算法

A recognition algorithm for adjusted interval digraphs

Asahi Takaoka

摘要:

最小序给出了顶点序的一个特征,这是一些图和有向图所共有的,如区间图、阈值容差图的补图(称为co-TT图)和双向正交射线图。调整区间有向图是具有最小序的自反有向图。调整后的区间有向图可以在$O(n^4)$时间内识别,其中$n$是给定图的顶点数。找到一个更有效的算法是一个悬而未决的问题。本文提出了一种新的带运行时间的识别算法$O(n^3)$。如果给定的图是一个调整区间有向图,该算法产生一个最小排序。

英文摘要:

Min orderings give a vertex ordering characterization, common to some graphs and digraphs such as interval graphs, complements of threshold tolerance graphs (known as co-TT graphs), and two-directional orthogonal ray graphs. An adjusted interval digraph is a reflexive digraph that has a min ordering. Adjusted interval digraph can be recognized in $O(n^4)$ time, where $n$ is the number of vertices of the given graph. Finding a more efficient algorithm is posed as an open question. This note provides a new recognition algorithm with running time $O(n^3)$. The algorithm produces a min ordering if the given graph is an adjusted interval digraph.

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

↑