Independent relaxed subproblems for dominance testing in CP-nets

DOI10.1007/978-3-031-73903-3_15MaRDI QIDQ7007801zbMATH OpenFDO

Authors Liu Jiang, Thomas E. Allen

Publication date 25 March 2025

Full work available at URL https://doi.org/10.1007/978-3-031-73903-3_15

zbMATH Keywords

CP-netsdominance testingheuristic searchindependent subproblemsrelaxed problems

Mathematics Subject Classification ID

Applications of graph theory (05C90) Individual preferences (91B08)

Cites work

• Depth-First Search and Linear Graph Algorithms
• Disjoint pattern database heuristics
• scientific article; zbMATH DE number 2243357 (Why is no real title available?)
• Rank pruning for dominance queries in CP-nets
• The computational complexity of dominance and consistency in CP-nets
• Uniform random generation and dominance testing for CP-nets

This page was built for publication: Independent relaxed subproblems for dominance testing in CP-nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7007801)