Succinct Encodings of Graph Isomorphism-Reference-Cited by-同舟云学术

Succinct Encodings of Graph Isomorphism

Published:2014 Issue: Volume: Page:285-296
ISSN:0302-9743
Container-title:Language and Automata Theory and Applications
language:
Short-container-title:

Author:

Das Bireswar,Scharpfenecker Patrick,Torán Jacobo

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-04921-2_23

Reference16 articles.

1. Babai, L., Luks, E.M.: Canonical labeling of graphs. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, STOC 1983, pp. 171–183. ACM Press, New York (1983)

2. Balcázar, J.L., Lozano, A., Torán, J.: The Complexity of Algorithmic Problems on Succinct Instances. Computer Science, Research and Applications. Springer US (1992)

3. Eiter, T., Gottlob, G., Mannila, H.: Adding disjunction to datalog (extended abstract). In: Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS 1994, pp. 267–278. ACM Press, New York (1994)

4. Lecture Notes in Computer Science;J. Feigenbaum,1998

5. Lecture Notes in Computer Science;H. Fleischner,2007

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

1. Checking LTL[F,G,X] on compressed traces in polynomial time;Proceedings of the 29th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2021-08-18

2. Data race detection on compressed traces;Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2018-10-26

3. Compressed Tree Canonization;Automata, Languages, and Programming;2015

4. On the Structure of Solution-Graphs for Boolean Formulas;Fundamentals of Computation Theory;2015

5. On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic;Mathematical Foundations of Computer Science 2014;2014