Timeline for Algorithm for computing fundamental group of simplicial complexes
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 7, 2018 at 17:30 | comment | added | Dan Ramras | Kruskal's algorithm will give you a maximal tree, and after that the presentation just involves listing the remaining edges as generators, and listing the relations that come from the 2-simplices. I don't really see anything interesting going on algorithmically once you've selected a maximal tree. | |
| Jul 7, 2018 at 15:50 | comment | added | yoyostein | Thanks. Is there a name for the algorithm to compute a presentation? | |
| Jul 7, 2018 at 15:49 | vote | accept | yoyostein | ||
| Jul 7, 2018 at 15:16 | history | answered | Igor Rivin | CC BY-SA 4.0 |