Author:
Das Bireswar,Torán Jacobo,Wagner Fabian
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference20 articles.
1. V. Arvind, P. Kurur, T.C. Vijayaraghavan, Bounded color multiplicity graph isomorphism is in the #L hierarchy, in: Proc. 20th IEEE CCC, 2005, pp. 13–27.
2. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees;Bodlaender;Journal of Algorithms,1990
3. A partial k-arboreum of graphs with bounded treewidth;Bodlaender;Theoretical Computer Science,1998
4. Combinatorial optimization of graphs of bounded treewidth;Bodlaender;The Computer Journal,2007
5. S. Datta, N. Limaye, P. Nimbhorkar, T. Thierauf, F. Wagner, Planar graph isomorphism is in Logspace, in: Proc. 24th IEEE CCC, 2009, pp. 203–214.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献