A linear-time algorithm to compute a MAD tree of an interval graph.
Elias DahlhausPeter DankelmannR. RaviPublished in: Inf. Process. Lett. (2004)
Keyphrases
- graph structure
- spanning tree
- steiner tree
- tree shaped
- tree structure
- minimum spanning tree
- hierarchical data structure
- directed graph
- tree construction
- maximum weight
- graph representation
- graph theory
- graph model
- structured data
- binary tree
- graph partitioning
- random walk
- graph data
- graph based algorithm
- connected components
- maximal cliques
- decision trees
- root node
- multi dimensional
- reachability queries
- tree models
- equivalence classes
- index structure
- directed acyclic graph
- complex networks
- bipartite graph
- graph matching
- b tree