Author:
van Bevern René,Downey Rodney G.,Fellows Michael R.,Gaspers Serge,Rosamond Frances A.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference49 articles.
1. Abrahamson, K.R., Fellows, M.R.: Cutset Regularity Beats Well-Quasi-Ordering for Bounded Treewidth. Tech. rep., Dept. Computer Science, University Victoria, Canada (1989)
2. Abrahamson, K.R., Fellows, M.R.: Finite automata, bounded treewidth, and well-quasiordering. In: Graph Structure Theory, American Mathematical Society, Contemporary Mathematics, vol. 147, pp. 539–564 (1991)
3. Bern, M.W., Lawler, E.L., Wong, A.L.: Why certain subgraph computations require only linear time. In: Proceedings of the 26th FOCS, IEEE Computer Society, pp. 117–125 (1985)
4. van Bevern, R., Downey, R.G., Fellows, M.R., Gaspers, S., Rosamond, F.A.: Myhill–Nerode Methods for Hypergraphs. arXiv:1211.1299v5 [cs.DM] (2015)
5. van Bevern, R., Fellows, M.R., Gaspers, S., Rosamond, F.A.: Myhill–Nerode methods for hypergraphs. In: Proceedings of the 24th ISAAC, LNCS, vol. 8283, pp. 372–382. Springer, Berlin (2013)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献