Author:
Fellows M. R.,Kratochvil J.,Middendorf M.,Pfeiffer F.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference22 articles.
1. Bodlaender, H., A linear time algorithm for finding tree-decompositions of small treewidth,Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, 1993, pp. 226?234.
2. Cameron, K., Induced matchings,Discrete Appl. Math. 24 (1989), 97?102.
3. Courcelle, B., The monadic second-order logic of graphs, I: Recognizable sets of finite graphs,Inform. and Control (to appear).
4. Edmonds, J., Maximum matching and a polyhedron with 0, 1 vertices,J. Res. Nat. Bur. Standards 69B (1965), 125?130.
5. Fellows, M. R., The Robertson-Seymour theorems: A survey of applications,Contemp. Math. 89 (1989), 1?18.
Cited by
52 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献