Pages that link to "Item:Q2506822"
From MaRDI portal
The following pages link to Augmenting forests to meet odd diameter requirements (Q2506822):
Displaying 6 items.
- On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (Q429689) (← links)
- Improved approximability and non-approximability results for graph diameter decreasing problems (Q764323) (← links)
- Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length (Q935155) (← links)
- Vertex fusion under distance constraints (Q1039434) (← links)
- Complexity and algorithms for constant diameter augmentation problems (Q2072060) (← links)
- Augmenting Outerplanar Graphs to Meet Diameter Requirements (Q2862552) (← links)
