Standard
All-pairs minimum cuts in near-linear time for surface-embedded graphs. / Borradaile, Glencora; Eppstein, David; Nayyeri, Amir; Wulff-Nilsen, Christian.
32nd International Symposium on Computational Geometry (SoCG 2016). red. / Sandor Fekete; Anna Lubiw. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. (Leibniz International Proceedings in Informatics, Bind 51).
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Harvard
Borradaile, G, Eppstein, D, Nayyeri, A
& Wulff-Nilsen, C 2016,
All-pairs minimum cuts in near-linear time for surface-embedded graphs. i S Fekete & A Lubiw (red),
32nd International Symposium on Computational Geometry (SoCG 2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics, bind 51, International Symposium on Computational Geometry (SoCG 2016), Boston, MA, USA,
14/06/2016.
https://doi.org/10.4230/LIPIcs.SoCG.2016.22APA
Borradaile, G., Eppstein, D., Nayyeri, A.
, & Wulff-Nilsen, C. (2016).
All-pairs minimum cuts in near-linear time for surface-embedded graphs. I S. Fekete, & A. Lubiw (red.),
32nd International Symposium on Computational Geometry (SoCG 2016) Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Leibniz International Proceedings in Informatics Bind 51
https://doi.org/10.4230/LIPIcs.SoCG.2016.22Vancouver
Borradaile G, Eppstein D, Nayyeri A
, Wulff-Nilsen C.
All-pairs minimum cuts in near-linear time for surface-embedded graphs. I Fekete S, Lubiw A, red., 32nd International Symposium on Computational Geometry (SoCG 2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 2016. (Leibniz International Proceedings in Informatics, Bind 51).
https://doi.org/10.4230/LIPIcs.SoCG.2016.22Author
Borradaile, Glencora ; Eppstein, David ; Nayyeri, Amir ; Wulff-Nilsen, Christian. / All-pairs minimum cuts in near-linear time for surface-embedded graphs. 32nd International Symposium on Computational Geometry (SoCG 2016). red. / Sandor Fekete ; Anna Lubiw. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. (Leibniz International Proceedings in Informatics, Bind 51).
Bibtex
@inproceedings{78133643badf4747a5f344c64857d190,
title = "All-pairs minimum cuts in near-linear time for surface-embedded graphs",
author = "Glencora Borradaile and David Eppstein and Amir Nayyeri and Christian Wulff-Nilsen",
year = "2016",
doi = "10.4230/LIPIcs.SoCG.2016.22",
language = "English",
series = "Leibniz International Proceedings in Informatics",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",
editor = "Sandor Fekete and Anna Lubiw",
booktitle = "32nd International Symposium on Computational Geometry (SoCG 2016)",
note = "null ; Conference date: 14-06-2016 Through 18-06-2016",
}
RIS
TY - GEN
T1 - All-pairs minimum cuts in near-linear time for surface-embedded graphs
AU - Borradaile, Glencora
AU - Eppstein, David
AU - Nayyeri, Amir
AU - Wulff-Nilsen, Christian
N1 - Conference code: 32
PY - 2016
Y1 - 2016
U2 - 10.4230/LIPIcs.SoCG.2016.22
DO - 10.4230/LIPIcs.SoCG.2016.22
M3 - Article in proceedings
T3 - Leibniz International Proceedings in Informatics
BT - 32nd International Symposium on Computational Geometry (SoCG 2016)
A2 - Fekete, Sandor
A2 - Lubiw, Anna
PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Y2 - 14 June 2016 through 18 June 2016
ER -
