Linear-time algorithms for partial \(k\)-tree complements

DOI10.1007/S004530010019zbMath0955.05093OpenAlexW2039582686MaRDI QIDQ1578411

T. Shermer, D. Kaller, Arvind Kumar Gupta

Publication date: 13 February 2001

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004530010019

zbMATH Keywords

monadic second-order logictreewidthpartial \(k\)-treescomplement graphsgraph factoring

Mathematics Subject Classification ID

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

This page was built for publication: Linear-time algorithms for partial \(k\)-tree complements