Timeline for Need an explanation on a network simplification algorithm
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 16, 2012 at 19:53 | vote | accept | culebrón | ||
| Mar 16, 2012 at 19:46 | comment | added | whuber | The entire idea of the algorithm is to collapse the subgraph to a point. Thus, at the outset, you know that all the original vertices {1,8,9} will be replaced by a single new vertex X. The issues to address are (1) where to locate X and (2) what connections to make to X from the remaining vertices. The connections are obvious: any edge originating from beyond the subgraph and ending within the subgraph needs to end in X. The only element of any interest in this particular algorithm is the decision not to base the location of X on any of the internal vertices. | |
| Mar 16, 2012 at 19:44 | comment | added | culebrón | So, {1, 8, 9} are replaced because they are duplicates in {A, 8, 9; 1, G, 9; 1, 8, F}, or just because they are the rest of the subgraph? (after removing the internal nodes) | |
| Mar 16, 2012 at 19:18 | history | answered | whuber | CC BY-SA 3.0 |