Minimizing the Oriented Diameter of a Planar Graph (Q2851475): Difference between revisions

@@ Property / author @@
-Q221681
@@ Property / author: Q221681 / rank @@
-Normal rank
@@ Property / author @@
+Steven D. Noble
@@ Property / author: Steven D. Noble / 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.endm.2009.07.043
+Normal rank
@@ Property / OpenAlex ID @@
+W2097160499
@@ Property / OpenAlex ID: W2097160499 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Distances in orientations of graphs
@@ Property / cites work: Distances in orientations of graphs / 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
+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:2851475