Sparsification upper and lower bounds for graph problems and not-all-equal SAT
From MaRDI portal
Publication:2408194
DOI10.1007/S00453-016-0189-9zbMATH Open1372.68129DBLPjournals/algorithmica/JansenP17OpenAlexW1909439116WikidataQ59513964 ScholiaQ59513964MaRDI QIDQ2408194
Author name not available (Why is that?)
Publication date: 10 October 2017
Published in: (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-016-0189-9
No records found.
No records found.
This page was built for publication: Sparsification upper and lower bounds for graph problems and not-all-equal SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408194)
