Pages that link to "Item:Q1029091"
From MaRDI portal
The following pages link to A linear-time algorithm to compute a MAD tree of an interval graph (Q1029091):
Displaying 8 items.
- Spanning trees: A survey (Q659663) (← links)
- On the intercluster distance of a tree metric (Q861256) (← links)
- On the minimum average distance spanning tree of the hypercube (Q934836) (← links)
- Computing the average distance of an interval graph (Q1334633) (← links)
- MAD trees and distance-hereditary graphs (Q1408821) (← links)
- On the minimum routing cost clustered tree problem (Q2359809) (← links)
- A survey of the all-pairs shortest paths problem and its variants in graphs (Q2629565) (← links)
- Distance preserving subtrees in minimum average distance spanning trees (Q2864852) (← links)