Degree bounded bottleneck spanning trees in three dimensions.

Patrick J. Andersen

Patrick J. Andersen Charl J. Ras Degree bounded bottleneck spanning trees in three dimensions. 457-491 2020 39 J. Comb. Optim. 2 https://doi.org/10.1007/s10878-019-00490-2 https://www.wikidata.org/entity/Q126641714 db/journals/jco/jco39.html#AndersenR20

Patrick J. Andersen Charl J. Ras Algorithms for Euclidean Degree Bounded Spanning Tree Problems. 121-160 2019 29 Int. J. Comput. Geom. Appl. 2 https://doi.org/10.1142/S0218195919500031 db/journals/ijcga/ijcga29.html#AndersenR19

Patrick J. Andersen Charl J. Ras Algorithms for Euclidean Degree Bounded Spanning Tree Problems. 2018 abs/1809.09348 CoRR http://arxiv.org/abs/1809.09348 db/journals/corr/corr1809.html#abs-1809-09348

Patrick J. Andersen Charl J. Ras Degree Bounded Bottleneck Spanning Trees in Three Dimensions. 2018 abs/1812.11177 CoRR http://arxiv.org/abs/1812.11177 db/journals/corr/corr1812.html#abs-1812-11177

Patrick J. Andersen Cyriac Grigorious Mirka Miller Minimum weight resolving sets of grid graphs. 1650048:1-1650048:22 2016 8 Discret. Math. Algorithms Appl. 3 https://doi.org/10.1142/S1793830916500488 db/journals/dmaa/dmaa8.html#AndersenGM16

Patrick J. Andersen Charl J. Ras Minimum bottleneck spanning trees with degree bounds. 302-314 2016 68 Networks 4 https://doi.org/10.1002/net.21710 db/journals/networks/networks68.html#AndersenR16

Cyriac Grigorious Mirka Miller Charl J. Ras