About Me
// Hello, World !
Top Answers
Top Questions
-
Given a graph G, verify all simple max paths that depart from vertex u necessarily pass 2 vertices associated with numbers of different parity
2 votes1 answers
-
Given a graph G and a subset of vertices A, write an efficient algorithm that prints, if they exist, two sets B, C subsets of V such that:(continue)
2 votes0 answers