Parameterized algorithms on geometric intersection graphs

IF 12.7 1区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Science Review Pub Date : 2025-08-05 DOI:10.1016/j.cosrev.2025.100796

Jie Xue , Meirav Zehavi

引用次数: 0

Abstract

We survey results on the parameterized complexity of various problems on geometric intersection graphs, particularly (unit) disk graphs. Specifically, we consider: (i) vertex-deletion, packing and pattern detection problems; (ii) Independent Set and Dominating Set; (iii) cut and connectivity problems; (iv) obstacle-removal problems. The discussions include introductions of some of the proof ideas and directions for future research.

查看原文本刊更多论文

几何交图的参数化算法

我们综述了几何相交图，特别是（单位）圆盘图上各种问题的参数化复杂性的研究结果。具体来说，我们考虑：(i)顶点删除，包装和模式检测问题；（ii）独立集和支配集；（iii）切断和连接问题；清除障碍的问题。讨论包括一些证明思路和未来研究方向的介绍。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Computer Science Review Computer Science-General Computer Science

CiteScore

32.70

自引率

0.00%

发文量

审稿时长

51 days

期刊介绍： Computer Science Review, a publication dedicated to research surveys and expository overviews of open problems in computer science, targets a broad audience within the field seeking comprehensive insights into the latest developments. The journal welcomes articles from various fields as long as their content impacts the advancement of computer science. In particular, articles that review the application of well-known Computer Science methods to other areas are in scope only if these articles advance the fundamental understanding of those methods.