Vertex fusion under diameter constraints
From MaRDI portal
Publication:3503481
DOI10.1016/j.endm.2007.07.044zbMath1341.05048MaRDI QIDQ3503481
Publication date: 5 June 2008
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2007.07.044
05C12: Distance in graphs
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- How to decrease the diameter of triangle-free graphs
- Augmenting trees to meet biconnectivity and diameter constraints
- Vertex fusion under diameter constraints
- Diameter increase caused by edge deletion
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Location on Tree Networks: P-Centre and n-Dispersion Problems
- Diameter bounds for altered graphs
- Algorithms and Computation
- Mixed covering of trees and the augmentation problem with odd diameter constraints