Bandwidth on AT-free graphs (Q650939): Difference between revisions

@@ Property / describes a project that uses @@
+symrcm
@@ Property / describes a project that uses: symrcm / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2011.09.011
+Normal rank
@@ Property / OpenAlex ID @@
+W1965845491
@@ Property / OpenAlex ID: W1965845491 / rank @@
+Normal rank
@@ Property / cites work @@
+The Bandwidth of Caterpillars with Hairs of Length 1 and 2
+Normal rank
@@ Property / cites work @@
+Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract)
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Asteroidal Triple-Free Graphs
@@ Property / cites work: Asteroidal Triple-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Exact and Approximate Bandwidth
@@ Property / cites work: Exact and Approximate Bandwidth / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear discrepancy and bandwidth
@@ Property / cites work: Linear discrepancy and bandwidth / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3664299
@@ Property / cites work: Q3664299 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Bandwidth of bipartite permutation graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
+Normal rank
@@ Property / cites work @@
+Computing the Bandwidth of Interval Graphs
@@ Property / cites work: Computing the Bandwidth of Interval Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2766686
@@ Property / cites work: Q2766686 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Bandwidth for Asteroidal Triple-Free Graphs
+Normal rank
@@ Property / cites work @@
+Optimal greedy algorithms for indifference graphs
@@ Property / cites work: Optimal greedy algorithms for indifference graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulating graphs without asteroidal triples
@@ Property / cites work: Triangulating graphs without asteroidal triples / rank @@
+Normal rank
@@ Property / cites work @@
+The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal greedy heuristic to color interval graphs
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the bandwidth minimization problem
+Normal rank
@@ Property / cites work @@
+Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Q3839788
@@ Property / cites work: Q3839788 / rank @@
+Normal rank