An algorithm for node-capacitated ring routing (Q2467482): Difference between revisions

@@ Property / author @@
-Zoltán Király
@@ Property / author: Zoltán Király / rank @@
-Normal rank
@@ Property / author @@
+Zoltán Király
@@ Property / author: Zoltán Király / 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.orl.2006.03.015
+Normal rank
@@ Property / OpenAlex ID @@
+W2072704702
@@ Property / OpenAlex ID: W2072704702 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-disjoint paths in planar graphs
@@ Property / cites work: Edge-disjoint paths in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Node-Capacitated Ring Routing
@@ Property / cites work: Node-Capacitated Ring Routing / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity flows in planar graphs
@@ Property / cites work: Multicommodity flows in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4840776
@@ Property / cites work: Q4840776 / rank @@
+Normal rank
@@ Property / cites work @@
+The Ring Loading Problem
@@ Property / cites work: The Ring Loading Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for edge-disjoint paths in planar graphs
+Normal rank