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

一个具有排除子图的拟多项式时间划分预言机

A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor

Reut Levi, Dana Ron

摘要:

受测试平面性和相关属性问题的启发,我们研究了设计高效的{ \em划分预言机}的问题。{ \em分区oracle}是一个过程,在给定对有界度图$G= (V,E)$的关联列表表示和参数$\eps$的访问时,当在顶点$v\in V$上查询时,返回$v$在所有图顶点的分区中所属的部分(顶点子集)。划分应该是这样的,所有部分都很小,每个部分都是连通的,如果图具有某些属性,则部分之间的边的总数至多为$\eps |V|$。本文在$1/\eps$中给出了查询复杂度为拟多项式的排除子图的划分预言机,从而改进了Hassidim等人({ \em Proceedings of FOCS 2009})在$1/\eps$中给出的查询复杂度为指数的划分预言机的结果.这一改进意味着相应的改进的复杂性测试的平面性和其他属性,其特征在于被排除的未成年人,以及次线性时间近似算法,工作的承诺下,该图有一个被排除的未成年人。

英文摘要:

Motivated by the problem of testing planarity and related properties, we study the problem of designing efficient {\em partition oracles}. A {\em partition oracle} is a procedure that, given access to the incidence lists representation of a bounded-degree graph $G= (V,E)$ and a parameter $\eps$, when queried on a vertex $v\in V$, returns the part (subset of vertices) which $v$ belongs to in a partition of all graph vertices. The partition should be such that all parts are small, each part is connected, and if the graph has certain properties, the total number of edges between parts is at most $\eps |V|$. In this work we give a partition oracle for graphs with excluded minors whose query complexity is quasi-polynomial in $1/\eps$, thus improving on the result of Hassidim et al. ({\em Proceedings of FOCS 2009}) who gave a partition oracle with query complexity exponential in $1/\eps$. This improvement implies corresponding improvements in the complexity of testing planarity and other properties that are characterized by excluded minors as well as sublinear-time approximation algorithms that work under the promise that the graph has an excluded minor.

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

↑