"Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal ..."

Bart M. P. Jansen, Astrid Pieterse (2017)

> Home

Details and statistics

DOI: 10.1007/S00453-016-0189-9

access: open

type: Journal Article

metadata version: 2019-06-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithmica/JansenP17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/JansenP17
Bart M. P. Jansen, Astrid Pieterse:
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT. Algorithmica 79(1): 3-28 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.