The Complexity of Symmetry Breaking in Massive Graphs

Christian Konrad; Sriram V. Pemmaraju; Talal Riaz; Peter Robinson

doi:10.4230/LIPIcs.DISC.2019.26

The Complexity of Symmetry Breaking in Massive Graphs

Christian Konrad, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson

Department of Computer Science

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

7 Citations (Scopus)

9 Downloads (Pure)

Original language	English
Title of host publication	33rd International Symposium on Distributed Computing, DISC 2019, October 14-18, 2019, Budapest, Hungary
Editors	Jukka Suomela
Publisher	Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Pages	26:1-26:18
Volume	146
DOIs	https://doi.org/10.4230/LIPIcs.DISC.2019.26
Publication status	Published - 2019

Publication series

Name	LIPIcs
Publisher	Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Access to Document

10.4230/LIPIcs.DISC.2019.26

Full-text PDF (final published version)
This is the final published version of the article (version of record). It first appeared online via DISC 2019 at https://doi.org/10.4230/LIPIcs.DISC.2019.26 . Please refer to any applicable terms of use of the publisher.
Final published version, 658 KBLicence: CC BY

https://doi.org/10.4230/LIPIcs.DISC.2019.26

Handle.net

Persistent link

Cite this

Konrad, C., Pemmaraju, S. V., Riaz, T., & Robinson, P. (2019). The Complexity of Symmetry Breaking in Massive Graphs. In J. Suomela (Ed.), 33rd International Symposium on Distributed Computing, DISC 2019, October 14-18, 2019, Budapest, Hungary (Vol. 146, pp. 26:1-26:18). (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2019.26

@inproceedings{b25c8c9f504a4018a4565712a92f1733,

title = "The Complexity of Symmetry Breaking in Massive Graphs",

author = "Christian Konrad and Pemmaraju, {Sriram V.} and Talal Riaz and Peter Robinson",

year = "2019",

doi = "10.4230/LIPIcs.DISC.2019.26",

language = "English",

volume = "146",

series = "LIPIcs",

publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",

pages = "26:1--26:18",

editor = "Jukka Suomela",

booktitle = "33rd International Symposium on Distributed Computing, DISC 2019, October 14-18, 2019, Budapest, Hungary",

}

The Complexity of Symmetry Breaking in Massive Graphs. / Konrad, Christian; Pemmaraju, Sriram V.; Riaz, Talal et al.

33rd International Symposium on Distributed Computing, DISC 2019, October 14-18, 2019, Budapest, Hungary. ed. / Jukka Suomela. Vol. 146 Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. p. 26:1-26:18 (LIPIcs).

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

TY - GEN

T1 - The Complexity of Symmetry Breaking in Massive Graphs

AU - Konrad, Christian

AU - Pemmaraju, Sriram V.

AU - Riaz, Talal

AU - Robinson, Peter

PY - 2019

Y1 - 2019

U2 - 10.4230/LIPIcs.DISC.2019.26

DO - 10.4230/LIPIcs.DISC.2019.26

M3 - Conference Contribution (Conference Proceeding)

VL - 146

T3 - LIPIcs

SP - 26:1-26:18

BT - 33rd International Symposium on Distributed Computing, DISC 2019, October 14-18, 2019, Budapest, Hungary

A2 - Suomela, Jukka

PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik

ER -