The clique problem with multiple-choice constraints under a cycle-free dependency graph

From MaRDI portal
Publication:2192065

DOI10.1016/j.dam.2019.12.015zbMath1446.90132OpenAlexW3001605797WikidataQ126288572 ScholiaQ126288572MaRDI QIDQ2192065

Maximilian Merkert, Patrick Gemander, Andreas Bärmann

Publication date: 29 June 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.12.015




Related Items (6)


Uses Software


Cites Work


This page was built for publication: The clique problem with multiple-choice constraints under a cycle-free dependency graph