Fast RNC and NC algorithms for maximal path sets
Copyright policy )Fast RNC and NC algorithms for maximal path sets
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- State University of New York at Potsdam United States
- University at Buffalo, State University of New York United States
- Center for Environmental Information Science Japan
- Tokyo Woman's Christian University Japan
- Tokyo Denki University Japan
graph algorithms, Parallel algorithms, Randomized parallel algorithms, parallel algorithms, randomized parallel algorithms, Approximation algorithms, Theoretical Computer Science, Maximal path sets, maximal path sets, shortest common superstrings, Shortest common superstrings, Distributed algorithms, Graph algorithms, approximation algorithms, Computer Science(all)
graph algorithms, Parallel algorithms, Randomized parallel algorithms, parallel algorithms, randomized parallel algorithms, Approximation algorithms, Theoretical Computer Science, Maximal path sets, maximal path sets, shortest common superstrings, Shortest common superstrings, Distributed algorithms, Graph algorithms, approximation algorithms, Computer Science(all)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!