Geodesic
Propagation Rules for Graph Partitioning Constraints
Journal of Graph Algorithms and Applications, Tome 20 (2016) no. 2, pp. 363-410.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

We review existing methods and present a generic propagation mechanism for graph partitioning constraints based on directed matchings. The task is also to give a set of several propagation rules according to specific partition properties. Every solution of the global constraint corresponds to a subgraph of the corresponding digraph associated with the constraint. The filtering identifies the arcs of the digraph that do not belong to a solution. We illustrate this principle on some common global constraints.
DOI : 10.7155/jgaa.00397
Keywords: constraint programming, filtering algorithms, global constraints, directed matching, strongly connected components, dominators 
@article{JGAA_2016_20_2_a8,
     author = {Rados{\l}aw Cymer},
     title = {Propagation {Rules} for {Graph} {Partitioning} {Constraints}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {363--410},
     publisher = {mathdoc},
     volume = {20},
     number = {2},
     year = {2016},
     doi = {10.7155/jgaa.00397},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00397/}
}
TY  - JOUR
AU  - Radosław Cymer
TI  - Propagation Rules for Graph Partitioning Constraints
JO  - Journal of Graph Algorithms and Applications
PY  - 2016
SP  - 363
EP  - 410
VL  - 20
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00397/
DO  - 10.7155/jgaa.00397
LA  - en
ID  - JGAA_2016_20_2_a8
ER  - 
%0 Journal Article
%A Radosław Cymer
%T Propagation Rules for Graph Partitioning Constraints
%J Journal of Graph Algorithms and Applications
%D 2016
%P 363-410
%V 20
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00397/
%R 10.7155/jgaa.00397
%G en
%F JGAA_2016_20_2_a8
Radosław Cymer. Propagation Rules for Graph Partitioning Constraints. Journal of Graph Algorithms and Applications, Tome 20 (2016) no. 2, pp. 363-410. doi : 10.7155/jgaa.00397. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00397/

Cité par Sources :