The maximum degree \& diameter-bounded subgraph and its applications
DOI10.1007/s10852-012-9182-8zbMath1305.05149OpenAlexW2114448624MaRDI QIDQ2392540
Anthony Dekker, Guillermo Pineda-Villavicencio, Hebert Pérez-Rosés, P. A. Watters
Publication date: 1 August 2013
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-012-9182-8
Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Signed and weighted graphs (05C22)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Approximating the degree-bounded minimum diameter spanning tree problem
- A family of graphs and the degree/diameter problem
- Emergence of Scaling in Random Networks
- Lipschitz class, narrow class, and counting lattice points
- Variation of the number of lattice points in large balls
- Approximating Maximum Diameter-Bounded Subgraphs
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results
- The NP-completeness column: An ongoing guide
- Approximation algorithms for degree-constrained minimum-cost network-design problems
This page was built for publication: The maximum degree \& diameter-bounded subgraph and its applications