One, Two and Three Times Log N/N for Paths in a Complete Graph With Random Weights

Combinatorics Probability and Computing - United Kingdom
doi 10.1017/s0963548399003892
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Cambridge University Press (CUP)

Related search

Undirected Graph Exploration With ⊝(log Log N) Pebbles

2015English

Scale-Free Property for Degrees and Weights in an N-Interactions Random Graph Model*

Journal of Mathematical Sciences
MathematicsApplied MathematicsStatisticsProbability
2016English

Paths With Two Blocks in N-Chromatic Digraphs

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2007English

Some New Integral Inequalities for N-Times Differentiable Log-Convex Functions

New Trends in Mathematical Science
2017English

Spectrum of Large Random Markov Chains: Heavy-Tailed Weights on the Oriented Complete Graph

Random Matrices: Theory and Application
StatisticsProbabilityAlgebraCombinatoricsUncertaintyNumber TheoryDiscrete Mathematics
2017English

An O(N Log N) Algorithm for Shape Modeling.

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
1996English

An Ω(n2 Log N) Lower Bound to the Shortest Paths Problem

1977English

RANDOMIZATION YIELDS SIMPLE O(n Log⋆ N) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS

International Journal of Computational Geometry and Applications
GeometryApplied MathematicsComputational TheoryComputational MathematicsMathematicsTheoretical Computer ScienceTopology
1992English

Drawing K N in Three Dimensions With One Bend Per Edge

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy