Efficient algorithms for Petersen's matching theorem

Authors:
Therese C. Biedl;Prosenjit Bose;Erik D. Demaine;Anna Lubiw
Affiliations:
School of Computer Science, McGill University, 3480 University Street, Montreal, Quebec H3A 2A7, Canada;School of Computer Science, Carleton University, 1125 Colonel by Drive, Ottawa, Ontario K1S 5B6, Canada;Department of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada;Department of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

Unique maximum matching algorithms

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Linear reductions of maximum matching

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The longest common subsequence problem for sequences with nested arc annotations

Journal of Computer and System Sciences - Computational biology 2002
Dynamic Graph Algorithms with Applications

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Euclidean representation of 3D electronic institutions: automatic generation

Proceedings of the working conference on Advanced visual interfaces
From graphs to Euclidean virtual worlds: visualization of 3D electronic institutions

ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Parallel algorithm to find minimum vertex guard set in a triangulated irregular network

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
A novel reduction approach for Petri net systems based on matching theory

Expert Systems with Applications: An International Journal

Hi-index	0.00