Pages that link to "Item:Q2167895"
From MaRDI portal
The following pages link to Almost optimal algorithms for diameter-optimally augmenting trees (Q2167895):
Displaying 6 items.
- On improving matchings in trees, via bounded-length augmentations (Q1801054) (← links)
- Minimizing the continuous diameter when augmenting a tree with a shortcut (Q2405291) (← links)
- (Q5111750) (← links)
- Algorithms and Data Structures (Q5394257) (← links)
- Mixed covering of trees and the augmentation problem with odd diameter constraints (Q5920611) (← links)
- Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees (Q5970916) (← links)