Efficient algorithms for Petersen's matching theorem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1999, Pages 130-139

  Biedl, Therese C ^a   Bose, Prosenjit ^a   Demaine, Erik D ^a   Lubiw, Anna ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; OPTIMIZATION; THEOREM PROVING;

PETERSEN'S MATCHING THEOREM;

ALGORITHMS;

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

References (35)