Pages that link to "Item:Q1408821"

The following pages link to MAD trees and distance-hereditary graphs (Q1408821):

Displaying 9 items.

• Spanning trees: A survey (Q659663) (← links)
• On the intercluster distance of a tree metric (Q861256) (← links)
• Combinatorial network abstraction by trees and distances (Q954979) (← links)
• A linear-time algorithm to compute a MAD tree of an interval graph (Q1029091) (← links)
• The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. (Q1408818) (← links)
• Multi-source spanning trees: Algorithms for minimizing source eccentricities. (Q1427201) (← links)
• The zoo of tree spanner problems (Q2476246) (← links)
• Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
• A survey of the all-pairs shortest paths problem and its variants in graphs (Q2629565) (← links)