Techniquecore
Reduction of longest paths to shortest paths
Technique that negates edge weights so a longest path problem becomes a shortest path problem on the same graph.
Technique that negates edge weights so a longest path problem becomes a shortest path problem on the same graph.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag PSDN67 Edit this page History Report an error