Constant memory routing in quasi-planar and quasi-polyhedral graphs (Q1003732): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2008.01.027
@@ Property / DOI: 10.1016/j.dam.2008.01.027 / rank @@
-Normal rank
@@ Property / cites work @@
+A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
+Normal rank
@@ Property / cites work @@
+Structural Information and Communication Complexity
+Normal rank
@@ Property / cites work @@
+Q4472479
@@ Property / cites work: Q4472479 / rank @@
+Normal rank
@@ Property / cites work @@
+AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE
+Normal rank
@@ Property / cites work @@
+Routing with guaranteed delivery in ad hoc wireless networks
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Wireless Sensor Networks
@@ Property / cites work: Algorithmic Aspects of Wireless Sensor Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
+Normal rank
@@ Property / cites work @@
+Geometric ad-hoc routing
@@ Property / cites work: Geometric ad-hoc routing / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2008.01.027
@@ Property / DOI: 10.1016/J.DAM.2008.01.027 / rank @@
+Normal rank