On finding highly connected spanning subgraphs

Basavaraju, Manu; Misra, Pranabendu; Ramanujan, M. S.; Saurabh, Saket

by Manu Basavaraju, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh

Reference:

On finding highly connected spanning subgraphsManu Basavaraju, Pranabendu Misra, M. S. Ramanujan, Saket SaurabhCoRR, volume abs/1701.02853, 2017.

Bibtex Entry:

@article{BasavarajuMRamanujanS17,
  author    = {Manu Basavaraju and
               Pranabendu Misra and
               M. S. Ramanujan and
               Saket Saurabh},
  title     = {On finding highly connected spanning subgraphs},
  journal   = {CoRR},
  volume    = {abs/1701.02853},
  year      = {2017},
  url       = {http://arxiv.org/abs/1701.02853},
  timestamp = {Wed, 01 Feb 2017 17:47:56 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/BasavarajuMRS17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}