Talk:Cut vertex: Difference between revisions
Content deleted Content added
No edit summary |
Snowmanradio (talk | contribs) re rate to Redirect using AWB |
||
| Line 1: | Line 1: | ||
{{WikiProject Computing|class= |
{{WikiProject Computing|class=Redirect|importance=NA}} |
||
==Untitled== |
|||
About what [http://en.wikipedia.org/wiki/User:McKay McKay] told me,I agree.But this article should present a better algorithm |
About what [http://en.wikipedia.org/wiki/User:McKay McKay] told me,I agree.But this article should present a better algorithm |
||
because the trivial one is really unusable in practice |
because the trivial one is really unusable in practice |
||
Revision as of 13:39, 19 December 2013
 | Computing Redirect‑class | ||||||
| |||||||
Untitled
About what McKay told me,I agree.But this article should present a better algorithm because the trivial one is really unusable in practice
Definition:
I am pretty sure the definition of a Cut Vertex is wrong. The only if part seems valid, but the if part does not (this would seem to imply any vertex with degree > 1 is a cut vertex). Went ahead and made this edit. This may be valid in some tree representations (and certain algorithms).