33 search results - page 5 / 7 » All-Pairs Bottleneck Paths in Vertex Weighted Graphs |
SOICT
2010
13 years 1 months ago
2010
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
ESA
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
DAM
2008
13 years 6 months ago
2008
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
SIGMOD
2010
ACM
13 years 11 months 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...
WADS
2007
Springer
14 years 11 days ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...