Vertex partitioning problems on partial k-trees

DOI10.1007/3-540-61422-2_129MaRDI QIDQ4375643zbMATH OpenOpenAlexFDO

Authors Arvind Kumar Gupta, D. Kaller, T. Shermer, Sanjeev Mahajan

Publication date 4 May 1998

Published in Algorithm Theory — SWAT'96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61422-2_129

zbMATH Keywords

co-dominating setsmonadic second-order logicpartial \(k\)-treespattern graphpolynomial-time algorithms

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• scientific article; zbMATH DE number 1341910
• Practical algorithms on partial k-trees with an application to domination-like problems

Cited in

(12)

• Algorithms for generalized vertex-rankings of partial k-trees
• Linear-time algorithms for partial k-tree complements
• Block-cutvertex trees and block-cutvertex partitions
• Tree partitioning via vertex deletion
• A Rooted-Forest Partition with Uniform Vertex Demand
• scientific article; zbMATH DE number 5526012 (Why is no real title available?)
• scientific article; zbMATH DE number 1088275 (Why is no real title available?)
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• scientific article; zbMATH DE number 7366688 (Why is no real title available?)
• Regular-factors in the complements of partial k-trees
• Practical algorithms on partial k-trees with an application to domination-like problems
• scientific article; zbMATH DE number 969981 (Why is no real title available?)

This page was built for publication: Vertex partitioning problems on partial k-trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375643)