Author:
Chaplick Steven,Fürst Maximilian,Maffray Frédéric,Rautenbach Dieter
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference15 articles.
1. M. Bartha, Efficient unique perfect matching algorithms, in: 8th Joint Conference on Mathematics and Computer Science, July 14–17, 2010, Komárno, Slovakia.
2. Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs;Chang;Lect. Notes Comput. Sci.,1996
3. Using bounded degree spanning trees in the design of efficient algorithms on claw-free graphs;Chrobak;Lect. Notes Comput. Sci.,2005
4. A linear recognition algorithm for cographs;Corneil;SIAM J. Comput.,1985
5. Matching and multidimensional matching in chordal and strongly chordal graphs;Dahlhaus;Discrete Appl. Math.,1998
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献