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

Jacques Dark; Christian Konrad

doi:10.4230/LIPIcs.CCC.2020.30

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

Jacques Dark, Christian Konrad

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

14 Citations (Scopus)

Original language	English
Title of host publication	35th Computational Complexity Conference (CCC 2020)
Publisher	Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany
Pages	1-14
Number of pages	14
Volume	169
ISBN (Print)	978-3-95977-156-6
DOIs	https://doi.org/10.4230/LIPIcs.CCC.2020.30
Publication status	Published - 28 Jul 2020
Event	Computational Complexity Conference - online Duration: 28 Jul 2020 → 31 Jul 2020 Conference number: 35

Publication series

Name	Leibniz International Proceedings in Informatics (LIPIcs)
ISSN (Electronic)	1868-8969

Conference

Conference	Computational Complexity Conference
Abbreviated title	CCC
Period	28/07/20 → 31/07/20

Access to Document

10.4230/LIPIcs.CCC.2020.30

Handle.net

Persistent link

Dr Christian Konrad
- christian.konradbristol.acuk
- School of Computer Science - Senior Lecturer in Computer Science
Person: Academic

Cite this

@inproceedings{c00f77b0492042c6b17c13002a19f568,

title = "Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams",

author = "Jacques Dark and Christian Konrad",

year = "2020",

month = jul,

day = "28",

doi = "10.4230/LIPIcs.CCC.2020.30",

language = "English",

isbn = "978-3-95977-156-6",

volume = "169",

series = "Leibniz International Proceedings in Informatics (LIPIcs)",

publisher = "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany",

pages = "1--14",

booktitle = "35th Computational Complexity Conference (CCC 2020)",

note = "Computational Complexity Conference, CCC ; Conference date: 28-07-2020 Through 31-07-2020",

}

Dark, J & Konrad, C 2020, Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams. in 35th Computational Complexity Conference (CCC 2020). vol. 169, Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, pp. 1-14, Computational Complexity Conference, 28/07/20. https://doi.org/10.4230/LIPIcs.CCC.2020.30

Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams. / Dark, Jacques; Konrad, Christian.
35th Computational Complexity Conference (CCC 2020). Vol. 169 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2020. p. 1-14 (Leibniz International Proceedings in Informatics (LIPIcs)).

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

TY - GEN

T1 - Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams

AU - Dark, Jacques

AU - Konrad, Christian

N1 - Conference code: 35

PY - 2020/7/28

Y1 - 2020/7/28

U2 - 10.4230/LIPIcs.CCC.2020.30

DO - 10.4230/LIPIcs.CCC.2020.30

M3 - Conference Contribution (Conference Proceeding)

SN - 978-3-95977-156-6

VL - 169

T3 - Leibniz International Proceedings in Informatics (LIPIcs)

SP - 1

EP - 14

BT - 35th Computational Complexity Conference (CCC 2020)

PB - Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany

T2 - Computational Complexity Conference

Y2 - 28 July 2020 through 31 July 2020

ER -

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

Publication series

Conference

Access to Document

Handle.net

Profiles

Dr Christian Konrad

Cite this