Author:
Matoušek Jiři,Thomas Robin
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference10 articles.
1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebraic Discrete Methods,1987
2. Linear time algorithms for NP-hard problems on graphs embedded in k-trees;Arnborg;Discrete Appl. Math.,1989
3. Polynomial algorithm for graph is isomorphism and chromatic index on partial k-trees;Bodlaender,1988
4. Computers and Intractability;Garey,1979
5. An O(n52 algorithm for maximum matching in bipartite graphs;Hopcroft;SIAM J. Comput.,1973
Cited by
117 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献