A Generalization of Janson inequalities and its application to finding shortest paths
Year: 1999
Type: conference-paper
Author: C. R. Subramanian
Institutions: Max Planck Society, Max Planck Institute for Informatics
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Keywords: shortest path, random graphs, probability bounds
Open Access status: closed
OpenAlex ID: W1496754705
