The Maximum Degree & Diameter-Bounded Subgraph and its Applications
- 10 February 2012
- journal article
- Published by Springer Nature in Journal of Mathematical Modelling and Algorithms
- Vol. 11 (3) , 249-268
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Modular clustering of protein-protein interaction networks2010
- Community detection in complex networks using extremal optimizationPhysical Review E, 2005
- Variation of the number of lattice points in large ballsActa Arithmetica, 2005
- Approximating the Degree-Bounded Minimum Diameter Spanning Tree ProblemAlgorithmica, 2004
- Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design ProblemsAlgorithmica, 2001
- A family of graphs and the degree/diameter problemJournal of Graph Theory, 2001
- Emergence of Scaling in Random NetworksScience, 1999
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1985
- Reducibility among Combinatorial Problems1972
- Topological constraints on interconnection-limited logic1964