A graph isomorphism condition and equivalence of reaction systems
暂无分享,去创建一个
[1] László Babai,et al. Graph isomorphism in quasipolynomial time [extended abstract] , 2016, STOC.
[2] Enrico Formenti,et al. On the complexity of occurrence and convergence problems in reaction systems , 2014, Natural Computing.
[3] Enrico Formenti,et al. Reachability in Resource-Bounded Reaction Systems , 2016, LATA.
[4] Enrico Formenti,et al. Fixed Points and Attractors of Reaction Systems , 2014, CiE.
[5] Andrzej Ehrenfeucht,et al. A Tour of reaction Systems , 2011, Int. J. Found. Comput. Sci..
[6] P. Hall. On Representatives of Subsets , 1935 .
[7] Ross M. McConnell,et al. Linear-time modular decomposition of directed graphs , 2005, Discret. Appl. Math..
[8] Enrico Formenti,et al. Cycles and Global Attractors of Reaction Systems , 2014, DCFS.
[9] Petko Valtchev,et al. Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice , 2009, ICFCA.
[10] Chad Giusti,et al. On Open and Closed Convex Codes , 2019, Discret. Comput. Geom..
[11] Andrzej Ehrenfeucht,et al. Reaction Systems , 2007, Fundam. Informaticae.
[12] T. Gallai. Transitiv orientierbare Graphen , 1967 .