Vertex fusion under distance constraints
From MaRDI portal
Publication:1039434
DOI10.1016/j.ejc.2009.03.014zbMath1186.05112OpenAlexW2049693356MaRDI QIDQ1039434
Publication date: 30 November 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2009.03.014
Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)
Uses Software
Cites Work
- Unnamed Item
- How to decrease the diameter of triangle-free graphs
- Augmenting trees to meet biconnectivity and diameter constraints
- Parametrized complexity theory.
- Augmenting forests to meet odd diameter requirements
- Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
- 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
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- R -Domination in Graphs
- Decreasing the diameter of bounded degree graphs
- Diameter bounds for altered graphs
- Mixed covering of trees and the augmentation problem with odd diameter constraints
This page was built for publication: Vertex fusion under distance constraints