Path-Contractions, Edge Deletions and Connectivity Preservation. Gutin, G., Ramanujan, M. S., Reidl, F., & Wahlström, M. In Pruhs, K. & Sohler, C., editors, 25th Annual European Symposium on Algorithms (ESA 2017), volume 87, of Leibniz International Proceedings in Informatics (LIPIcs), pages 47:1--47:13, Dagstuhl, Germany, 2017. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
Path-Contractions, Edge Deletions and Connectivity Preservation [link]Paper  doi  bibtex   
@inproceedings{GRamanujanRW,
  author ={Gregory Gutin and M. S. Ramanujan and Felix Reidl and Magnus Wahlstr{\"o}m},
  title ={{Path-Contractions, Edge Deletions and Connectivity Preservation}},
  booktitle ={25th Annual European Symposium on Algorithms (ESA 2017)},
  pages ={47:1--47:13},
  series ={Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN ={978-3-95977-049-1},
  ISSN ={1868-8969},
  year ={2017},
  volume ={87},
  editor ={Kirk Pruhs and Christian Sohler},
  publisher ={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address ={Dagstuhl, Germany},
  URL ={http://drops.dagstuhl.de/opus/volltexte/2017/7827},
  URN ={urn:nbn:de:0030-drops-78270},
  doi ={10.4230/LIPIcs.ESA.2017.47},
  annote ={Keywords: connectivity, strong connectivity, vertex deletion, arc contraction},
  keywords={xtract}
}

Downloads: 0