FO和MSO方法解某些图问题:逼近和多时间结果
FO and MSO approach to Some Graph Problems: Approximation and Poly time Results
摘要:
本文的重点是两个方面。首先,我们提出了一个逻辑的方法来处理图的修改问题,如最小节点删除,边删除,边扩充问题,通过表示为一阶逻辑(FO)的表达式。因此,这些问题具有常数因子多项式时间近似算法。特别地,当图$G$的结果为上图、分裂图、阈值图、可比图、区间图和置换图时,其节点删除/边删除是$O(1)$可逼近的.其次,我们给出了一元二阶逻辑来处理最小图修改问题、最小支配集问题和最小着色问题及其变体。因此,它遵循这些问题有界树宽图的线性时间算法。特别地,我们证明了有界树宽图的星形着色,cd着色,彩虹着色,均匀着色,全支配集,连通支配集的线性时间算法的存在性。简单地说,本文给出了用FO和MSO求解某些图问题的统一框架和逻辑表达式的算法方案。
英文摘要:
The focus of this paper is two fold. Firstly, we present a logical approach to graph modification problems such as minimum node deletion, edge deletion, edge augmentation problems by expressing them as an expression in first order (FO) logic. As a consequence, it follows that these problems have constant factor polynomial-time approximation algorithms. In particular, node deletion/edge deletion on a graph $G$ whose resultant is cograph, split, threshold, comparable, interval and permutation are $O(1)$ approximable. Secondly, we present a monadic second order (MSO) logic to minimum graph modification problems, minimum dominating set problem and minimum coloring problem and their variants. As a consequence, it follows that these problems have linear-time algorithms on bounded tree-width graphs. In particular, we show the existance of linear-time algorithms on bounded tree-width graphs for star coloring, cd-coloring, rainbow coloring, equitable coloring, total dominating set, connected dominating set. In a nut shell, this paper presents a unified framework and an algorithmic scheme through logical expressions for some graph problems through FO and MSO.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。