Article

Graph isomorphism is in the low hierarchy

Author:

U. SchöningAuthors Info & Claims

4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87

Pages 114 - 124

Published: 01 February 1987 Publication History

Abstract

No abstract available.

Cited By

View all

Bei XChen NZhang SBoneh DRoughgarden TFeigenbaum J(2013)On the complexity of trial and errorProceedings of the forty-fifth annual ACM symposium on Theory of Computing10.1145/2488608.2488613(31-40)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.1145/2488608.2488613
Grzonkowski SZaremba WZaremba MMcDaniel BZadeh LBadr YAbraham AOhsawa YChbeir RFerri FKoeppen MLaurent D(2008)Extending web applications with a lightweight zero knowledge proof authenticationProceedings of the 5th international conference on Soft computing as transdisciplinary science and technology10.1145/1456223.1456241(65-70)Online publication date: 28-Oct-2008
https://dl.acm.org/doi/10.1145/1456223.1456241
Luks EMiyazaki TGiusti M(2002)Polynomial-time normalizers for permutation groups with restricted composition factorsProceedings of the 2002 international symposium on Symbolic and algebraic computation10.1145/780506.780529(176-183)Online publication date: 10-Jul-2002
https://dl.acm.org/doi/10.1145/780506.780529

Index Terms

Graph isomorphism is in the low hierarchy

Recommendations

Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs

This paper deals with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chordal graphs. It is known that GI problem is GI complete even for some special graph classes including regular graphs, bipartite ...
Hecke Algebras and the Lusztig Isomorphism
Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
WG'12: Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science

We study the complexity of the Graph Isomorphism problem on graph classes that are characterized by a finite number of forbidden induced subgraphs, focusing mostly on the case of two forbidden subgraphs. We show hardness results and develop techniques ...

Comments

Information & Contributors

Information

Published In

4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87

February 1987

484 pages

ISBN:038717219X

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 February 1987

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bei XChen NZhang SBoneh DRoughgarden TFeigenbaum J(2013)On the complexity of trial and errorProceedings of the forty-fifth annual ACM symposium on Theory of Computing10.1145/2488608.2488613(31-40)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.1145/2488608.2488613
Grzonkowski SZaremba WZaremba MMcDaniel BZadeh LBadr YAbraham AOhsawa YChbeir RFerri FKoeppen MLaurent D(2008)Extending web applications with a lightweight zero knowledge proof authenticationProceedings of the 5th international conference on Soft computing as transdisciplinary science and technology10.1145/1456223.1456241(65-70)Online publication date: 28-Oct-2008
https://dl.acm.org/doi/10.1145/1456223.1456241
Luks EMiyazaki TGiusti M(2002)Polynomial-time normalizers for permutation groups with restricted composition factorsProceedings of the 2002 international symposium on Symbolic and algebraic computation10.1145/780506.780529(176-183)Online publication date: 10-Jul-2002
https://dl.acm.org/doi/10.1145/780506.780529

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs

Hecke Algebras and the Lusztig Isomorphism

Graph isomorphism for graph classes characterized by two forbidden induced subgraphs

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations