The complexity of two graph orientation problems (Q412352): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2112534214
@@ Property / OpenAlex ID: W2112534214 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2478
@@ Property / arXiv ID: 1004.2478 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Digraphs
@@ Property / cites work: Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Separating systems and oriented graphs of diameter two
+Normal rank
@@ Property / cites work @@
+Distances in orientations of graphs
@@ Property / cites work: Distances in orientations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385531
@@ Property / cites work: Q4385531 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. VIII: Orientations
+Normal rank
@@ Property / cites work @@
+Q3077955
@@ Property / cites work: Q3077955 / rank @@
+Normal rank
@@ Property / cites work @@
+Bidimensional Parameters and Local Treewidth
@@ Property / cites work: Bidimensional Parameters and Local Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Diameter and treewidth in minor-closed graph families, revisited
+Normal rank
@@ Property / cites work @@
+Linearity of grid minors in treewidth with applications through bidimensionality
+Normal rank
@@ Property / cites work @@
+Minimizing the Oriented Diameter of a Planar Graph
+Normal rank
@@ Property / cites work @@
+Diameter and treewidth in minor-closed graph families
+Normal rank
@@ Property / cites work @@
+Complexity of approximating the oriented diameter of chordal graphs
+Normal rank
@@ Property / cites work @@
+Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
+Normal rank
@@ Property / cites work @@
+On orientations and shortest paths
@@ Property / cites work: On orientations and shortest paths / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal orientations of graphs and digraphs: A survey
+Normal rank
@@ Property / cites work @@
+Graph minor theory
@@ Property / cites work: Graph minor theory / 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 / cites work @@
+Quickly excluding a planar graph
@@ Property / cites work: Quickly excluding a planar graph / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:412352