algorithm - Graph partitioning with constraints -


given graph g(v,e) , set of pairs p = {[vi,vj]...} i'm looking algorithm partition graph (into smallest possible number of path-connected patches) such 2 vertices make pair in p belong different partitions.

any or correct-direction-pointing appreciated!


Comments

Popular posts from this blog

c++ - No viable overloaded operator for references a map -

java - Custom OutputStreamAppender not run: LOGBACK: No context given for <MYAPPENDER> -

java - Cannot secure connection using TLS -