2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.DS2008
Computing Minimum Spanning Trees with Uncertainty
Thomas Erlebach, Michael Hoffmann, Danny Krizanc +2
We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge of the graph only…
cs.DS2003★ 2 cited
Range Mode and Range Median Queries on Lists and Trees
Danny Krizanc, Pat Morin, Michiel Smid
We consider algorithms for preprocessing labelled lists and trees so that, for any two nodes u and v we can answer queries of the form: What is the mode or median label in the sequ…