Johanna Björklund, Frank Drewes, Anna Jonsson. Finding the N best vertices in an infinite weighted hypergraph. Theoretical Computer Science, 682:30-41, 2017. [doi]
@article{BjorklundDJ17,
title = {Finding the N best vertices in an infinite weighted hypergraph},
author = {Johanna Björklund and Frank Drewes and Anna Jonsson},
year = {2017},
doi = {10.1016/j.tcs.2017.03.010},
url = {https://doi.org/10.1016/j.tcs.2017.03.010},
researchr = {https://researchr.org/publication/BjorklundDJ17},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {682},
pages = {30-41},
}