Timeline for How to find central vertex in a graph?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 28, 2018 at 13:58 | answer | added | Alejandro Alvarez-Socorro | timeline score: 0 | |
| Feb 26, 2012 at 22:35 | answer | added | Aaron Meyerowitz | timeline score: 3 | |
| Feb 25, 2012 at 1:00 | answer | added | Andrew D. King | timeline score: 6 | |
| Feb 24, 2012 at 22:15 | comment | added | Gerry Myerson | At the risk of stating the obvious, of course there is an algorithm (assuming $G$ is finite). For each vertex $v$, find its distance to each other vertex; for each vertex $v$, look at the numbers you've worked out and see which one is largest; look at this list of largest numbers, and see which ones are smallest. Perhaps you wanted to ask what the most efficient algorithm is? | |
| Feb 24, 2012 at 13:07 | answer | added | Joseph O'Rourke | timeline score: 5 | |
| Feb 24, 2012 at 9:50 | answer | added | Balazs | timeline score: 2 | |
| Feb 24, 2012 at 9:23 | history | asked | Mathsniper | CC BY-SA 3.0 |