Author:
Dahlhaus Elias,Karpinski Marek
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference16 articles.
1. A polynomial time algorithm for b-matching;Anstee;Inform. Process. Lett.,1987
2. On the desirability of acyclic database schemes;Beeri;J. ACM,1983
3. A characterization of rigid circuit graphs;Buneman;Discrete Math.,1974
4. Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs;Chang,1996
5. Chordale Graphen im besonderen Hinblick auf parallele Algorithmen;Dahlhaus,1991
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献