Sparsification upper and lower bounds for graph problems and not-all-equal SAT

From MaRDI portal
Publication:2408194

DOI10.1007/s00453-016-0189-9zbMath1372.68129OpenAlexW1909439116WikidataQ59513964 ScholiaQ59513964MaRDI QIDQ2408194

Astrid Pieterse, Bart M. P. Jansen

Publication date: 10 October 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-016-0189-9




Related Items



Cites Work