Myhill-Nerode Methods for Hypergraphs-Reference-Cited by-同舟云学术

Myhill-Nerode Methods for Hypergraphs

Published:2013 Issue: Volume: Page:372-382
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

van Bevern René,Fellows Michael R.,Gaspers Serge,Rosamond Frances A.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-45030-3_35

Reference19 articles.

1. Abrahamson, K.R., Fellows, M.R.: Finite automata, bounded treewidth, and well-quasiordering. In: Graph Structure Theory. Contemporary Mathematics, vol. 147, pp. 539–564. American Mathematical Society (1991)

2. van Bevern, R., Fellows, M.R., Gaspers, S., Rosamond, F.A.: Myhill-nerode methods for hypergraphs (2013), arxiv:1211.1299v3 (cs.DM)

3. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996)

4. Bodlaender, H.L., Fellows, M.R., Thilikos, D.M.: Derivation of algorithms for cutwidth and related graph layout parameters. J. Comput. Syst. Sci. 75(4), 231–244 (2009)

5. Cahoon, J., Sahni, S.: Exact algorithms for special cases of the board permutation problem. In: Proceedings of the 21st Annual Allerton Conference on Communication, Control, and Computing, pp. 246–255 (1983)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth;SIAM Journal on Computing;2017-01

2. Myhill–Nerode Methods for Hypergraphs;Algorithmica;2015-02-26

3. Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth;2014 IEEE 55th Annual Symposium on Foundations of Computer Science;2014-10

4. Myhill-Nerode Methods for Hypergraphs;Algorithms and Computation;2013