Takanori Yamamoto, Hideo Bannai, Masao Nagasaki, Satoru Miyano. Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality. In João Gama, VÃtor Santos Costa, AlÃpio Mário Jorge, Pavel Brazdil, editors, Discovery Science, 12th International Conference, DS 2009, Porto, Portugal, October 3-5, 2009. Volume 5808 of Lecture Notes in Computer Science, pages 465-472, Springer, 2009. [doi]
@inproceedings{YamamotoBNM09,
title = {Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality},
author = {Takanori Yamamoto and Hideo Bannai and Masao Nagasaki and Satoru Miyano},
year = {2009},
doi = {10.1007/978-3-642-04747-3_40},
url = {http://dx.doi.org/10.1007/978-3-642-04747-3_40},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/YamamotoBNM09},
cites = {0},
citedby = {0},
pages = {465-472},
booktitle = {Discovery Science, 12th International Conference, DS 2009, Porto, Portugal, October 3-5, 2009},
editor = {João Gama and VÃtor Santos Costa and AlÃpio Mário Jorge and Pavel Brazdil},
volume = {5808},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-04746-6},
}