Timeline for Topology of densest graphs whose optimal $3D$-matching can be calculated efficiently
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 28, 2021 at 16:12 | history | edited | Manfred Weis | CC BY-SA 4.0 |
added a heuristic for partitioning the vertex set
|
| Nov 28, 2021 at 13:43 | history | edited | Manfred Weis | CC BY-SA 4.0 |
added a missing factor of $n$ for the number of edges
|
| Nov 28, 2021 at 12:40 | history | asked | Manfred Weis | CC BY-SA 4.0 |