On switching classes, NLC-width, cliquewidth and treewidth (Q418754): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2011.12.021
@@ Property / DOI: 10.1016/j.tcs.2011.12.021 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C70
@@ Property / Mathematics Subject Classification ID: 05C70 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C12
@@ Property / Mathematics Subject Classification ID: 05C12 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C78
@@ Property / Mathematics Subject Classification ID: 05C78 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C05
@@ Property / Mathematics Subject Classification ID: 05C05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C75
@@ Property / Mathematics Subject Classification ID: 05C75 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6039158
@@ Property / zbMATH DE Number: 6039158 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph decomposition
@@ Property / zbMATH Keywords: graph decomposition / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2011.12.021
+Normal rank
@@ Property / OpenAlex ID @@
+W2077329115
@@ Property / OpenAlex ID: W2077329115 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59567556
@@ Property / Wikidata QID: Q59567556 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+A Linear Recognition Algorithm for Cographs
@@ Property / cites work: A Linear Recognition Algorithm for Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023227
@@ Property / cites work: Q4023227 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4492680
@@ Property / cites work: Q4492680 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic labeled 2-structures
@@ Property / cites work: Dynamic labeled 2-structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448752
@@ Property / cites work: Q4448752 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure of node-label-controlled graph languages
+Normal rank
@@ Property / cites work @@
+Q4489221
@@ Property / cites work: Q4489221 / rank @@
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Q5513521
@@ Property / cites work: Q5513521 / rank @@
+Normal rank
@@ Property / cites work @@
+\(k\)-NLC graphs and polynomial algorithms
@@ Property / cites work: \(k\)-NLC graphs and polynomial algorithms / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/tcs/BodlaenderH12
@@ Property / DBLP publication ID: journals/tcs/BodlaenderH12 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2011.12.021
@@ Property / DOI: 10.1016/J.TCS.2011.12.021 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:418754