Go to the corresponding LIPIcs Volume Portal 
Chandran, L. Sunil ; Cheung, Yun Kuen ; Issac, Davis
pdfformat: 

@InProceedings{chandran_et_al:LIPIcs:2018:9036, author = {L. Sunil Chandran and Yun Kuen Cheung and Davis Issac}, title = {{Spanning Tree Congestion and Computation of Generalized Gy{\"o}riLov{\'a}sz Partition}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {32:132:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770767}, ISSN = {18688969}, year = {2018}, volume = {107}, editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'a}niel Marx and Donald Sannella}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9036}, URN = {urn:nbn:de:0030drops90361}, doi = {10.4230/LIPIcs.ICALP.2018.32}, annote = {Keywords: Spanning Tree Congestion, Graph Sparsification, Graph Partitioning, MinMax Graph Partitioning, kVertexConnected Graphs, Gy{\"o}riLov{\'a}sz Theorem} }
Keywords:  Spanning Tree Congestion, Graph Sparsification, Graph Partitioning, MinMax Graph Partitioning, kVertexConnected Graphs, GyöriLovász Theorem  
Collection:  45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)  
Issue Date:  2018  
Date of publication:  04.07.2018 