Combinatorial network abstraction by trees and distances (Q954979): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2008.03.037
@@ Property / DOI: 10.1016/j.tcs.2008.03.037 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W1982160332
@@ Property / OpenAlex ID: W1982160332 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of network synchronization
@@ Property / cites work: Complexity of network synchronization / rank @@
+Normal rank
@@ Property / cites work @@
+Network analysis. Methodological foundations.
@@ Property / cites work: Network analysis. Methodological foundations. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3836515
@@ Property / cites work: Q3836515 / rank @@
+Normal rank
@@ Property / cites work @@
+NP-completeness of minimum spanner problems
@@ Property / cites work: NP-completeness of minimum spanner problems / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of spanning tree problems: Part I
@@ Property / cites work: Complexity of spanning tree problems: Part I / rank @@
+Normal rank
@@ Property / cites work @@
+There are planar graphs almost as good as the complete graph
+Normal rank
@@ Property / cites work @@
+MAD trees and distance-hereditary graphs
@@ Property / cites work: MAD trees and distance-hereditary graphs / rank @@
+Normal rank
@@ Property / cites work @@
+$(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
+Normal rank
@@ Property / cites work @@
+Tree spanners in planar graphs
@@ Property / cites work: Tree spanners in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the minimum diameter spanning tree problem
@@ Property / cites work: On the minimum diameter spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Some optimal inapproximability results
@@ Property / cites work: Some optimal inapproximability results / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the network design problem
@@ Property / cites work: The complexity of the network design problem / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating spanners
@@ Property / cites work: On the hardness of approximating spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Additive Tree Spanners
@@ Property / cites work: Additive Tree Spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Additive graph spanners
@@ Property / cites work: Additive graph spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Low complexity variants of the arrow distributed directory
+Normal rank
@@ Property / cites work @@
+Graph spanners
@@ Property / cites work: Graph spanners / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Synchronizer for the Hypercube
@@ Property / cites work: An Optimal Synchronizer for the Hypercube / rank @@
+Normal rank
@@ Property / cites work @@
+Distance approximating spanning trees
@@ Property / cites work: Distance approximating spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+The centrality index of a graph
@@ Property / cites work: The centrality index of a graph / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2008.03.037
@@ Property / DOI: 10.1016/J.TCS.2008.03.037 / rank @@
+Normal rank