45 search results - page 6 / 9 » Vertex rankings of chordal graphs and weighted trees |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
SIGMOD
2010
ACM
14 years 10 days ago
2010
ACM
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
DEXA
2010
Springer
13 years 7 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
SAC
2003
ACM
14 years 24 days ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...