Live briefing
Everything about Widest path problem
Path-finding using high-weight graph edges
In graph algorithms, the widest path problem is the problem of finding a path between two designated vertices in a weighted graph, maximizing the weight of the minimum-weight edge in the path. The widest path problem is also known as the maximum capacity path problem. It is possible to adapt most shortest path algorithms to compute widest paths, by modifying them to use the bottleneck distance instead of path length. However, in many cases even faster algorithms are possible. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Widest path problemA 5-minute orientation
- Pick up a classic book: Intelligence BulletinThe most-reprinted book on the subject
- Read the landmark paper: Two Algorithms for the k-Widest Path ProblemCited 0 times
- Go sideways: Minimum spanning treeA closely related topic
- Go sideways: Shortest path problemA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
Intelligence BulletinUnited States. War Department. Military Intelligence Service · 1942
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Minimum spanning tree In graph theory, a minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph…
- Shortest path problem In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights…
- Floyd–Warshall algorithm In computer science, the Floyd–Warshall algorithm (also known as Floyd's algorithm, the Roy–Warshall algorithm, the Roy–Floyd algorithm, or the WFI algorithm)…
- Distance (graph theory) In the mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path (also called a graph…
- Suurballe's algorithm In theoretical computer science and network routing, Suurballe's algorithm is an algorithm for finding two disjoint paths in a nonnegatively-weighted directed…
- Minimum bottleneck spanning tree In mathematics, a minimum bottleneck spanning tree (MBST) in an undirected graph is a spanning tree in which the most expensive edge is as cheap as possible…
- Glossary of graph theory Look up Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs,…
- Squaregraph In graph theory, a branch of mathematics, a squaregraph is a type of undirected graph that can be drawn in the plane in such a way that every bounded face…