The k-path coloring problem in graphs of bounded treewidth: An application in integrated circuit manufacturing.
Dehia Ait-FerhatVincent JuliardGautier StaufferJ. Andres TorresPublished in: Oper. Res. Lett. (2020)
Keyphrases
- bounded treewidth
- integrated circuit
- np complete
- printed circuit boards
- highly parallelizable
- conjunctive queries
- decision problems
- boolean functions
- relational learning
- graph theoretic
- np hard
- information extraction
- databases
- query evaluation
- constraint satisfaction
- data management
- electron beam
- fixed parameter tractable