Minimum vertex ranking spanning tree problem for chordal and proper interval graphs.
Dariusz DereniowskiPublished in: Discuss. Math. Graph Theory (2009)
Keyphrases
- undirected graph
- spanning tree
- minimum cost
- minimum weight
- minimum spanning tree
- interval data
- edge weights
- ranking algorithm
- web search
- random graphs
- directed graph
- ranking functions
- strongly connected
- vertex set
- labeled graphs
- minmax regret
- approximation algorithms
- learning to rank
- score function
- average degree
- directed acyclic graph
- weighted graph
- ranked list
- complex networks
- np hard
- minimum length