Sparse Graph
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2118 Accepted Submission(s): 752
Problem Description
In graph theory, the
complement of a graph
G is a graph
H on the same vertices such that two distinct vertices of
H are adjacent if and only if they are
not adjacent in
G