A Linear Network Code Construction for General Integer Connections Based on the Constraint Satisfaction Problem.
Ying CuiMuriel MédardEdmund M. YehDouglas J. LeithFan LaiKen R. DuffyPublished in: IEEE/ACM Trans. Netw. (2017)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- special case
- constraint propagation
- constraint programming
- tractable subclasses
- non binary
- pseudo boolean optimization
- np hard
- np complete
- constraint solving
- search space
- arc consistency
- tractable classes
- constraint networks
- temporal constraints
- finite domain
- forward checking
- constraint graph
- graph coloring problems
- partial constraint satisfaction
- decomposition methods
- complex networks
- hard constraints
- network structure
- search algorithm