"Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams."

Jacques Dark, Christian Konrad (2020)

> Home

Details and statistics

DOI: 10.4230/LIPICS.CCC.2020.30

access: open

type: Conference or Workshop Paper

metadata version: 2023-02-28

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/coco/DarkK20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/DarkK20
Jacques Dark, Christian Konrad:
Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams. CCC 2020: 30:1-30:14

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.