129 reputation
3
bio website
location
age
visits member for 4 years, 1 month
seen Jul 31 '13 at 23:52

Nov
28
accepted Fast question about minimum spanning trees
Nov
28
comment Fast question about minimum spanning trees
wow, really simple.. now the graphs I was drawing seem like aliens compared to this one, thanks.
Nov
28
awarded  Supporter
Nov
28
comment Fast question about minimum spanning trees
a edge from T0 may be in T*1 and all the other edges, let;s say, in T*2.. both T*1 and T*2 are MST.. does this imply that T0 is also MST ?
Nov
28
asked Fast question about minimum spanning trees
Nov
1
accepted The isomorphic subgraph problem
Nov
1
awarded  Scholar
Nov
1
accepted Eulerian graphs proof
Nov
1
accepted Maximum independent set in a tree. Review algorithm, need proof
Nov
1
asked The isomorphic subgraph problem
Oct
31
comment Maximum independent set in a tree. Review algorithm, need proof
are you suggesting that this would be enough to say in order to prove that it's the maximal ?
Oct
31
asked Maximum independent set in a tree. Review algorithm, need proof
Oct
31
comment Eulerian graphs proof
hint2 is ok. Not sure about hint 1.. I think I'll still have to prove that my path has no consecutive edges of the same color.
Oct
31
awarded  Student
Oct
31
asked Eulerian graphs proof