Efficient determination of the k most vital edges for the minimum spanning tree problem
Year of publication: |
2012
|
---|---|
Authors: | Bazgan, Cristina ; Toubaline, Sonia ; Vanderpooten, Daniel |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 39.2012, 11, p. 2888-2898
|
Subject: | Graphentheorie | Graph theory |
-
Connectedness between G10 currencies : searching for the causal structure
Bettendorf, Timo, (2023)
-
Cheng, Ying, (2023)
-
Exploratory analysis of grocery product networks
Hsieh, Ping-hung, (2022)
- More ...
-
Critical edges for the assignment problem : complexity and exact resolution
Bazgan, Cristina, (2013)
-
Complexity of determining the most vital elements for the p-median and p-center location problems
Bazgan, Cristina, (2013)
-
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
Bazgan, Cristina, (2013)
- More ...