Timeline for How to identify bridge nodes between nearly connected graph components in partitioned adjacency matrices?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 7, 2013 at 10:39 | vote | accept | Vass | ||
| Feb 1, 2013 at 20:13 | answer | added | Felix Goldberg | timeline score: 1 | |
| Feb 1, 2013 at 20:02 | answer | added | Aaron Meyerowitz | timeline score: 1 | |
| Feb 1, 2013 at 16:43 | comment | added | Aaron Meyerowitz | Do you mean nearly complete components. How big are they relative to the vertex set and how dense? Imagine a square grid with $n^2$ points and $2n$ lines. Make it into a graph where each vertex is on $2n-2$ edges. If you order the matrix by rows then you have a block matrix with each block complete and a vertex having only one bridge to each other block. But you could organize by columns and swap roles of bridge and non-bridge. | |
| Feb 1, 2013 at 14:15 | history | asked | Vass | CC BY-SA 3.0 |