A short note on the complexity of computing strong pathbreadth (Q1705708): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2018.01.005
@@ Property / DOI: 10.1016/j.ipl.2018.01.005 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2018.01.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2791129715
@@ Property / OpenAlex ID: W2791129715 / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth: Characterizations, Applications, and Computations
+Normal rank
@@ Property / cites work @@
+On intervalizing \(k\)-colored graphs for DNA physical mapping
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+To Approximate Treewidth, Use Treelength!
@@ Property / cites work: To Approximate Treewidth, Use Treelength! / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-decompositions with bags of small diameter
@@ Property / cites work: Tree-decompositions with bags of small diameter / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
+Normal rank
@@ Property / cites work @@
+Line-Distortion, Bandwidth and Path-Length of a Graph
+Normal rank
@@ Property / cites work @@
+On compact and efficient routing in certain graph classes
+Normal rank
@@ Property / cites work @@
+On the Complexity of Computing Treebreadth
@@ Property / cites work: On the Complexity of Computing Treebreadth / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching in a convex bipartite graph
@@ Property / cites work: Maximum matching in a convex bipartite graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Sandwich Problems
@@ Property / cites work: Graph Sandwich Problems / rank @@
+Normal rank
@@ Property / cites work @@
+On Strong Tree-Breadth
@@ Property / cites work: On Strong Tree-Breadth / rank @@
+Normal rank
@@ Property / cites work @@
+Representation of a finite graph by a set of intervals on the real line
+Normal rank
@@ Property / cites work @@
+On the complexity of computing treelength
@@ Property / cites work: On the complexity of computing treelength / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2018.01.005
@@ Property / DOI: 10.1016/J.IPL.2018.01.005 / rank @@
+Normal rank