Back to Search
Start Over
Finding paths in sparse random graphs requires many queries.
- Source :
- Random Structures & Algorithms; Jan2017, Vol. 50 Issue 1, p71-85, 18p
- Publication Year :
- 2017
-
Abstract
- We discuss a new algorithmic type of problem in random graphs studying the minimum number of queries one has to ask about adjacency between pairs of vertices of a random graph [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 10429832
- Volume :
- 50
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Random Structures & Algorithms
- Publication Type :
- Academic Journal
- Accession number :
- 119628157
- Full Text :
- https://doi.org/10.1002/rsa.20680