On some conditioning results in the probabilistic analysis of algorithms
Copyright policy ) Colin McDiarmid;
On some conditioning results in the probabilistic analysis of algorithms
A simple combinatorial approach is given for handling certain conditioning problems that arise in the probabilistic analysis of graph algorithms.
- University of Oxford United Kingdom
Graph theory (including graph drawing) in computer science, Applied Mathematics, probabilistic analysis of graph algorithms, Discrete Mathematics and Combinatorics
Graph theory (including graph drawing) in computer science, Applied Mathematics, probabilistic analysis of graph algorithms, Discrete Mathematics and Combinatorics
citations 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).2 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
Citations provided by BIP!
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).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 2
Average
Average
Average
hybrid
Fields of Science (4) View all
Related to Research communities