Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs (Q6202224): Difference between revisions

Revision as of 17:05, 28 August 2024

scientific article; zbMATH DE number 7824311

Language	Label	Description	Also known as
English	Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs	scientific article; zbMATH DE number 7824311

Statements

instance of

scholarly article

0 references

title

Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs (English)

0 references

0 references

0 references

0 references

0 references

0 references

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing

0 references

publication date

26 March 2024

0 references

zbMATH Keywords

compact routing

0 references

planar graph

0 references

distributed algorithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1145/3583668.3594561

0 references

cites work

Distributed Computing

0 references

Compact routing on euclidian metrics

0 references

Q5875752

0 references

Near-Optimal Distributed Routing with Low Memory

0 references

Q5875457

0 references

Competitive routing in hybrid communication networks

0 references

Improved parallel depth-first search in undirected planar graphs

0 references

Planar diameter via metric compression

0 references

Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs

0 references

Q3549709

0 references

Compact oracles for reachability and approximate distances in planar digraphs

0 references

Identifiers

DOI

10.1145/3583668.3594561

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6202224

@@ Property / cites work @@
+Distributed Computing
@@ Property / cites work: Distributed Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Compact routing on euclidian metrics
@@ Property / cites work: Compact routing on euclidian metrics / rank @@
+Normal rank
@@ Property / cites work @@
+Q5875752
@@ Property / cites work: Q5875752 / rank @@
+Normal rank
@@ Property / cites work @@
+Near-Optimal Distributed Routing with Low Memory
@@ Property / cites work: Near-Optimal Distributed Routing with Low Memory / rank @@
+Normal rank
@@ Property / cites work @@
+Q5875457
@@ Property / cites work: Q5875457 / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive routing in hybrid communication networks
+Normal rank
@@ Property / cites work @@
+Improved parallel depth-first search in undirected planar graphs
+Normal rank
@@ Property / cites work @@
+Planar diameter via metric compression
@@ Property / cites work: Planar diameter via metric compression / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs
+Normal rank
@@ Property / cites work @@
+Q3549709
@@ Property / cites work: Q3549709 / rank @@
+Normal rank
@@ Property / cites work @@
+Compact oracles for reachability and approximate distances in planar digraphs
+Normal rank