Timeline for Reachability in graphs using adjacent matrix
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 16, 2015 at 15:02 | history | edited | Stefan Kohl♦ |
Added top-level tag.
|
|
| Sep 13, 2013 at 4:40 | history | edited | xzhh | CC BY-SA 3.0 |
deleted 324 characters in body
|
| Sep 13, 2013 at 4:36 | comment | added | Untitled | Don't ask multiple questions in one post. It makes it hard to get a good answer. Post the new one separately. | |
| Sep 13, 2013 at 2:47 | history | edited | xzhh | CC BY-SA 3.0 |
added 288 characters in body
|
| Sep 13, 2013 at 2:40 | comment | added | xzhh | Yes, but $A_0$ is uncertain matrix due to the random distribution of nodes. I know the meaning of the result. What I'm confused is how to calculate the result. | |
| Sep 12, 2013 at 6:50 | answer | added | Untitled | timeline score: 1 | |
| Sep 12, 2013 at 5:59 | comment | added | Untitled | Is $A_0$ reflexive? | |
| Sep 12, 2013 at 5:21 | history | edited | xzhh | CC BY-SA 3.0 |
added 54 characters in body
|
| Sep 4, 2013 at 1:58 | history | asked | xzhh | CC BY-SA 3.0 |