Generating minimal k-vertex connected spanning subgraphs

  • Authors:

  • Endre Boros;Konrad Borys;Khaled Elbassioni;Vladimir Gurvich;Kazuhisa Makino;Gabor Rudolf

  • Affiliations:

  • RUTCOR, Rutgers University, Piscataway NJ;RUTCOR, Rutgers University, Piscataway NJ;Max-Planck-Institut für Informatik, Saarbrücken, Germany;RUTCOR, Rutgers University, Piscataway NJ;Graduate School of Engineering Science, Osaka University, Toyonaka, Osaka, Japan;RUTCOR, Rutgers University, Piscataway NJ

  • Venue:
  • COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We show that minimal k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k.