The $k$-path coloring problem in graphs with bounded treewidth: an application in integrated circuit manufacturing.
Dehia Ait-FerhatVincent JuliardGautier StaufferAndres J. TorresPublished in: CoRR (2019)
Keyphrases
- bounded treewidth
- integrated circuit
- np complete
- printed circuit boards
- decision problems
- conjunctive queries
- highly parallelizable
- shortest path
- relational learning
- boolean functions
- computational complexity
- electron beam
- machine learning
- query language
- fixed parameter tractable
- hardware description language
- monadic datalog