QCSP on semicomplete digraphs

DOI10.1007/978-3-662-43948-7_70MaRDI QIDQ5167797zbMATH OpenOpenAlexFDO

Authors Petar Marković, Barnaby Martin, Petar Dapić

Publication date 1 July 2014

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://eprints.mdx.ac.uk/16766/1/webICALP2014.pdf

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Quantified constraint satisfaction problem on semicomplete digraphs
• Principles and Practice of Constraint Programming – CP 2004
• QCSP on partially reflexive cycles -- the wavy line of tractability
• QCSP on partially reflexive forests
• From complexity to algebra and back: digraph classes, collapsibility, and the PGP

Cited in

(6)

• QCSP on partially reflexive forests
• From complexity to algebra and back: digraph classes, collapsibility, and the PGP
• QCSP on partially reflexive cycles -- the wavy line of tractability
• Quantified Constraints in Twenty Seventeen
• Quantified constraint satisfaction problem on semicomplete digraphs
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: QCSP on semicomplete digraphs

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