Widest path problem

In graph algorithms, the widest path problem is the problem of finding a path between two designated vertices in a weighted graph, maximizing the…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

We introduce a co-analysis technique designed for correspondence inference within large shape collections. Such collections are…

2016

Shortest Path problems are among the most studied network flow optimization problems, with the interesting applications in the…

2015

Wireless Sensor Network (WSN) comprises the less power consuming, light weight and effective Sensor Nodes (SNs) for higher…

2013

The widest path problem is a graph problem which is defined as finding the most optimal path between two vertices in a weighted…

2013

Link-based dissimilarity measures, such as shortest path or Euclidean commute time distance, base their distance on paths…

2012

In mobile ad hoc network, efficient routing protocol is required to perform route discovery and maintenance. These protocols can…

2010

Large cascade blackouts are generally catastrophic both economically and socially, when they occur. In this work, a transmission…

2007

Dynamic programmingis well-known as a powerful modeling techniquefor dealing with the issue of making optimal decisions…

2004

A method for determining the highest available-bandwidth paths in a core-stateless network, with or without restrictions, is…

1997