20 citations · 28 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
Alexander van der Grinten, Elisabetta Bergamini, Oded Green +2
Network analysis defines a number of centrality measures to identify the most central nodes in a network. Fast computation of those measures is a major challenge in algorithmic net…
cs.DS2017★ 8 cited
Exemplar or Matching: Modeling DCJ Problems with Unequal Content Genome Data
Zhaoming Yin, Jijun Tang, Stephen W. Schaeffer +1
The edit distance under the DCJ model can be computed in linear time for genomes with equal content or with Indels. But it becomes NP-Hard in the presence of duplications, a proble…