A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs
Published in J. Heuristics 9(5): 401-427, 2003
Bibtex:
@article{DBLP:journals/heuristics/LjubieR03,
author = {Ivana Ljubic and
G{\"{u}}nther R. Raidl},
title = {A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation
of Graphs},
journal = {J. Heuristics},
volume = {9},
number = {5},
pages = {401--427},
year = {2003},
url = {https://doi.org/10.1023/B:HEUR.0000004810.27436.30},
doi = {10.1023/B:HEUR.0000004810.27436.30},
timestamp = {Sun, 02 Jun 2019 20:50:35 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/LjubieR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}