AN ALGORITHM TO FIND A MAXIMUM MATCHING OF A TRAPEZOID GRAPH
暂无分享,去创建一个
[1] Madhumangal Pal,et al. An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs , 2002, Int. J. Comput. Math..
[2] 박경민,et al. 역할 메타모델 확장에 기반한 개발방법론 프로세스 설계 , 2005 .
[3] Baruch Schieber,et al. Slowing sequential algorithms for obtaining fast distributed and parallel algorithms: maximum matchings , 1986, PODC '86.
[4] John Clark,et al. A First Look at Graph Theory , 1991 .
[5] Silvio Micali,et al. An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[6] Harold N. Gabow,et al. Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.
[7] Zhi-Zhong Chen,et al. Parallel approximation algorithms for maximum weighted matching in general graphs , 2000, Inf. Process. Lett..
[8] Stephan Olariu,et al. An optimal parallel matching algorithm for cographs , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.
[9] ZVI GALIL,et al. Efficient algorithms for finding maximum matching in graphs , 1986, CSUR.