A Linear Network Code Construction for General Integer Connections Based on the Constraint Satisfaction Problem.
Ying CuiMuriel MédardDhaivat PandyaEdmund M. YehDouglas J. LeithKen R. DuffyPublished in: GLOBECOM (2015)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- constraint programming
- special case
- tractable subclasses
- pseudo boolean optimization
- np complete
- constraint solving
- tractable classes
- partial constraint satisfaction
- search space
- network structure
- peer to peer
- symmetry breaking
- graph coloring problems
- np hard
- non binary
- hard constraints
- finite domain
- hypertree decomposition