Complete-Subgraph-Transversal-Sets problem on bounded treewidth graphs-Reference-Cited by-同舟云学术

Complete-Subgraph-Transversal-Sets problem on bounded treewidth graphs

Published:2021-05 Issue:4 Volume:41 Page:923-933
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Liu Ke,Lu Mei^ORCID

Funder

National Natural Science Foundation of China

Tsinghua University Initiative Scientific Research Program

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

https://link.springer.com/content/pdf/10.1007/s10878-021-00703-7.pdf

Reference23 articles.

1. Alber J, Bodlaender HL, Fernau H, Kloks T, Niedermeier R (2002) Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33:461–493

2. Arnborg S, Corneil DG, Proskurowski A (1987) Complexity of finding embeddings in a $$k$$-tree. SIAM J Alg Discrete Methods 8:277–284

3. Balachandran V, Nagavamsi P, Rangan CP (1996) Clique transversal and clique independence on comparability graphs. Inf Process Lett 58:181–184

4. Bertelé U, Brioschi F (1972) Nonserial dynamic programming. Academic Press, New York

5. Bodlaender HL (1996) A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J Comput 25(6):1305–1317

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exploring Clique Transversal Variants on Distance-Hereditary Graphs: Computational Insights and Algorithmic Approaches;Algorithms;2024-08-16

2. Exploring Clique Transversal Problems for d-degenerate Graphs with Fixed d: From Polynomial-Time Solvability to Parameterized Complexity;Axioms;2024-06-04

3. Clique Transversal Variants on Graphs: A Parameterized-Complexity Perspective;Mathematics;2023-07-28

4. Upper Clique Transversals in Graphs;Graph-Theoretic Concepts in Computer Science;2023

5. Remarks on Parameterized Complexity of Variations of the Maximum-Clique Transversal Problem on Graphs;Symmetry;2022-03-24