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

java - Ebean enhancement ignores a model -

ubuntu - How to disable Kernel Module Signing in linux -

SQL php on different pages to Insert (mysqli) -