arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1305.2772cs.DScs.LO
收藏

基于OBDD的区间图表示

OBDD-Based Representation of Interval Graphs

Marc Gillé

摘要:

图$G = (V,E)$可以由边集$χ_E$的特征函数来描述,边集将一对二进制编码的节点映射到1,如果节点相邻。使用\emph{Ordered Binary Decision Diagrams}(OBDD)来存储$χ_E$可以导致(希望)紧凑的表示。给定OBDD作为输入,基于符号/隐式OBDD的图算法可以主要通过使用函数运算(例如量化或二进制合成)来解决优化问题。虽然OBDD表示大小一般不能很小,但对于特殊的图类,它可以证明很小,然后也会导致快速算法。本文证明了单位区间图的OBDD大小为$O(\ | V \ | /\log \ | V \ |)$,区间图的OBDD大小为$O(\ | V \ | \log \ | V \ |)$,改进了Nunkesser和Woelfel(2009)的一个已知结果.此外,我们可以证明,使用我们的变量顺序和节点标记的区间图的最坏情况下的OBDD大小是$Ω(\ | V \ | \log \ | V \ |)$。我们使用的邻接矩阵的结构来证明这些界限。这种方法可以是独立的兴趣,并可以应用到其他图形类。我们还开发了一个最大匹配算法的单位区间图使用$O(\log \ | V \ |)$操作和着色算法的单位和一般区间图使用$O(\log^2 \ | V \ |)$操作和经验评估的算法。

英文摘要:

A graph $G = (V,E)$ can be described by the characteristic function of the edge set $χ_E$ which maps a pair of binary encoded nodes to 1 iff the nodes are adjacent. Using \emph{Ordered Binary Decision Diagrams} (OBDDs) to store $χ_E$ can lead to a (hopefully) compact representation. Given the OBDD as an input, symbolic/implicit OBDD-based graph algorithms can solve optimization problems by mainly using functional operations, e.g. quantification or binary synthesis. While the OBDD representation size can not be small in general, it can be provable small for special graph classes and then also lead to fast algorithms. In this paper, we show that the OBDD size of unit interval graphs is $O(\ | V \ | /\log \ | V \ |)$ and the OBDD size of interval graphs is $O(\ | V \ | \log \ | V \ |)$ which both improve a known result from Nunkesser and Woelfel (2009). Furthermore, we can show that using our variable order and node labeling for interval graphs the worst-case OBDD size is $Ω(\ | V \ | \log \ | V \ |)$. We use the structure of the adjacency matrices to prove these bounds. This method may be of independent interest and can be applied to other graph classes. We also develop a maximum matching algorithm on unit interval graphs using $O(\log \ | V \ |)$ operations and a coloring algorithm for unit and general intervals graphs using $O(\log^2 \ | V \ |)$ operations and evaluate the algorithms empirically.

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

↑