scientific article; zbMATH DE number 1341910

MaRDI QIDQ4263472zbMATH OpenFDO

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

Publication date 23 February 2000

zbMATH Keywords

dynamic-programming algorithmgeneralized matching problemmonadic second-order logicpartial \(k\)-treespolynomial-time algorithm

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39)

Recommendations

• On tree-constrained matchings and generalizations
• On tree-constrained matchings and generalizations
• Generalized matchings in trees
• Generalized matchings in forests
• Polynomial time algorithms for variants of graph matching on partial k-trees
• On the complexity of a family of generalized matching problems
• On some optimization problems on \(k\)-trees and partial \(k\)-trees
• On the completeness of a generalized matching problem
• On k-match problems

Cited in

(4)

• Polynomial time algorithms for variants of graph matching on partial k-trees
• Log-space algorithms for paths and matchings in k-trees
• scientific article; zbMATH DE number 1088275 (Why is no real title available?)
• Vertex partitioning problems on partial k-trees

This page was built for publication:

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