Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT
Algorithmica - United States
doi 10.1007/s00453-016-0189-9
Full Text
Open PDFAbstract
Available in full text
Date
August 22, 2016
Authors
Publisher
Springer Science and Business Media LLC