Timeline for Maximum matching in a graph with no "shortcuts"
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 10, 2017 at 13:03 | comment | added | Max Alekseyev | Also, there may exist edges even within the same level (except $L_0$). | |
| Mar 10, 2017 at 12:32 | comment | added | Max Alekseyev | In other words, $L_j$ is the set of vertices $v$ such that a shortest path from a source to $v$ has length $j$. Notice that in such layering there may exist "back edges" from $L_i$ to $L_j$ with $i>j>0$. But you do not take them into account when consider the "deleted edges". | |
| Mar 10, 2017 at 7:41 | history | edited | usul | CC BY-SA 3.0 |
deleted 7 characters in body
|
| Mar 10, 2017 at 7:34 | history | edited | usul | CC BY-SA 3.0 |
added 480 characters in body
|
| Mar 10, 2017 at 7:25 | history | answered | usul | CC BY-SA 3.0 |