Complete-subgraph-transversal-sets problem on bounded treewidth graphs

DOI10.1007/s10878-021-00703-7OpenAlexW3161063901MaRDI QIDQ2045031

Ke Liu, Mei Lu

Publication date: 11 August 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00703-7

zbMATH Keywords

algorithmstreewidthNP-complete problemscomplete subgraph

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. III. Planar tree-width
• Covering all cliques of a graph
• Covering the cliques of a graph with vertices
• S-functions for graphs
• On approximation of the vertex cover problem in hypergraphs
• Tree-width, path-width, and cutwidth
• Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
• On clique-transversals and clique-independent sets
• Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
• Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
• Algorithmic aspects of clique-transversal and clique-independent sets
• Distance-hereditary graphs are clique-perfect
• On tree width, bramble size, and expansion
• Nonserial dynamic programming
• On balanced graphs
• Complexity of Finding Embeddings in a k-Tree
• Algorithmic Aspects of Neighborhood Numbers
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

This page was built for publication: Complete-subgraph-transversal-sets problem on bounded treewidth graphs