Author:
Otachi Yota,Schweitzer Pascal
Publisher
Springer International Publishing
Reference28 articles.
1. Arvind, V., Das, B., Köbler, J., Toda, S.: Colored hypergraph isomorphism is fixed parameter tractable. In: FSTTCS, pp. 327–337 (2010)
2. Lecture Notes in Computer Science;C. Berkholz,2013
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.: Necessary edges in k-chordalisations of graphs. J. Comb. Optim. 7(3), 283–290 (2003)
5. Bouchitté, V., Todinca, I.: Listing all potential maximal cliques of a graph. Theor. Comput. Sci. 276(1-2), 17–32 (2002)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Graph isomorphism restricted by lists;Theoretical Computer Science;2021-03
2. An Improved Isomorphism Test for Bounded-tree-width Graphs;ACM Transactions on Algorithms;2020-06-26
3. Ranked Enumeration of Minimal Triangulations;Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '19;2019
4. Canonizing Graphs of Bounded Tree Width in Logspace;ACM Transactions on Computation Theory;2017-10-09
5. Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth;SIAM Journal on Computing;2017-01