Pages that link to "Item:Q5900302"
From MaRDI portal
The following pages link to Principles and Practice of Constraint Programming – CP 2004 (Q5900302):
Displaying 12 items.
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions (Q516870) (← links)
- Solution counting algorithms for constraint-centered search heuristics (Q2272161) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- A SAT Approach to Clique-Width (Q2946763) (← links)
- Solution Counting Algorithms for Constraint-Centered Search Heuristics (Q3523086) (← links)
- Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
- An Experimental Study of the Treewidth of Real-World Graph Data (Q5091123) (← links)
- Positive-Instance Driven Dynamic Programming for Treewidth. (Q5111757) (← links)
- Computing treewidth on the GPU (Q5111889) (← links)
- (Q5150500) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- On the Integration of Singleton Consistencies and Look-Ahead Heuristics (Q5302725) (← links)
