Generalization of Janson inequalities and its application to finding shortest paths

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1999, Pages 795-804

  Subramanian, C R ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; RANDOM PROCESSES; SET THEORY;

JANSON INEQUALITIES; SHORTEST PATHS ALGORITHMS;

ALGORITHMS;

EID: 0032777281     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)