4. The method of claim 3 , wherein each maximal clique includes nodes that can be merged without creating a conflict.
3. The method of claim 1 , wherein splitting the one or more merged nodes into respective sub-sets of merged nodes comprises, for each merged node of the one or more merged nodes, generating a reduced graph comprising a plurality of maximal cliques.