Thread Graphs, Linear Rank-Width and Their Algorithmic Applications (Q3000492): Difference between revisions

@@ Property / cites work @@
+The bandwidth problem for graphs and matrices—a survey
+Normal rank
@@ Property / cites work @@
+Thread Graphs, Linear Rank-Width and Their Algorithmic Applications
+Normal rank
@@ Property / cites work @@
+Better Polynomial Algorithms on Graphs of Bounded Rank-Width
+Normal rank
@@ Property / cites work @@
+On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
+Normal rank
@@ Property / cites work @@
+Improved Bandwidth Approximation for Trees and Chordal Graphs
+Normal rank
@@ Property / cites work @@
+Pathwidth is NP-Hard for Weighted Trees
@@ Property / cites work: Pathwidth is NP-Hard for Weighted Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank