k Most Vital Edges for the Minimum Spanning Tree Problem.">k Most Vital Edges for the Minimum Spanning Tree Problem., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

default search action

combined dblp search
author search
venue search
publication search

ask others

"Efficient Algorithms for Finding the k Most Vital Edges for the ..."

Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten (2011)

> Home

Details and statistics

DOI: 10.1007/978-3-642-22616-8_11

access: closed

type: Conference or Workshop Paper

metadata version: 2017-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoa/BazganTV11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoa/BazganTV11
Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten:
Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem. COCOA 2011: 126-140

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.