The maximum degree \& diameter-bounded subgraph and its applications (Q2392540): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10852-012-9182-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2114448624
@@ Property / OpenAlex ID: W2114448624 / rank @@
+Normal rank
@@ Property / cites work @@
+Degree-Constrained Subgraph Problems: Hardness and Approximation Results
+Normal rank
@@ Property / cites work @@
+Approximating Maximum Diameter-Bounded Subgraphs
@@ Property / cites work: Approximating Maximum Diameter-Bounded Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Emergence of Scaling in Random Networks
@@ Property / cites work: Emergence of Scaling in Random Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4342497
@@ Property / cites work: Q4342497 / rank @@
+Normal rank
@@ Property / cites work @@
+A family of graphs and the degree/diameter problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: An ongoing guide
@@ Property / cites work: The NP-completeness column: An ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the degree-bounded minimum diameter spanning tree problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for degree-constrained minimum-cost network-design problems
+Normal rank
@@ Property / cites work @@
+Variation of the number of lattice points in large balls
+Normal rank
@@ Property / cites work @@
+Lipschitz class, narrow class, and counting lattice points
+Normal rank