Article

Free access

Isomorphism testing for embeddable graphs through definability

Author:

Martin GroheAuthors Info & Claims

STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing

Pages 63 - 72

https://doi.org/10.1145/335305.335313

Published: 01 May 2000 Publication History

PDF eReader

References

[1]

L. Babai. Moderately exponential bound for graph isomorphism. In F. Gcseg, editor, Fundamentals of Computation Theory, FCT'81, volume 117 of Lecture Notes in Computer Science, pages 34-50. Springer-Verlag, 1981.]]

Digital Library

Google Scholar

[2]

L. Babai, D. Y. D.Y. Grigoryev, and D. Mount. Isomorphism of graphs with bounded eigenvalue multiplicity. In Proceedings of the ldth A CM Symposium on Theory of Computing, pages 310-324, 1982.]]

Digital Library

Google Scholar

[3]

L. Babai, P. ErdSs, and S. Selkow. Random graph isomorphism. SIAM Journal on Computing, 9:628-635, 1980.]]

Digital Library

Google Scholar

[4]

L. Babai and L. Kur:era. Canonical labelling of graphs in linear average time. In Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, pages 39-46, 1979.]]

Digital Library

Google Scholar

[5]

H. Bodlaender. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. Journal of Algorithms, 11:631-643, 1990.]]

Digital Library

Google Scholar

[6]

R. Boppana, J. Hastad, and S. Zachos. Does co-NP have short interactive proofs? Information Processing Letters, 25:127-132, 1987.]]

Digital Library

Google Scholar

[7]

J. Cat, M. Fiirer, and N. Immerman. An optimal lower bound on the number of variables for graph identification. Combinatorica, 12:389-410, 1992.]]

Crossref

Google Scholar

[8]

A. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer and System Sciences, 25:99-128, 1982.]]

Crossref

Google Scholar

[9]

H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, second edition, 1995.]]

Google Scholar

[10]

S. Evdokimov, M. Karpinski, and I. Ponomarenko. On a new high dimensional Weisfeiler-Lehman algorithm. Journal of Algebraic Combinatorics, 10:29-45, 1999.]]

Digital Library

Google Scholar

[11]

S. Evdokimov and I. Ponomarenko. On highly closed cellular algebras and highly closed isomorphism. Electronic Journal of Combinatorics, 6:~R18, 1999.]]

Google Scholar

[12]

I. S. Filotti and J. N. Mayer. A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus. In Proceedings of the 12th A CM Symposium on Theory of Computing, pages 236-243, 1980.]]

Digital Library

Google Scholar

[13]

M. Grohe. Finite-variable logics in descriptive complexity theory. Bulletin of Symbolic Logic, 4:345-399, 1998.]]

Crossref

Google Scholar

[14]

M. Grohe. Fixed-point logics on planar graphs. In Proceedings of the 13th IEEE Symposium on Logic in Computer Science, pages 6-15, 1998.]]

Digital Library

Google Scholar

[15]

M. Grohe and J. Marifio. Definability and descriptive complexity on databases of bounded tree-width. In C. Beeri and P. Buneman, editors, Proceedings of the 7th international Conference on Database Theory, volume 1540 of Lecture Notes in Computer Science, pages 70-82. Springer-Verlag, 1999.]]

Digital Library

Google Scholar

[16]

C. Hoffmann. Group-theoretic algorithms and graph isomorphism, volume 136 of Lecture Notes in Computer Science. Springer-Verlag, 1982.]]

Google Scholar

[17]

J. Hopcroft and J. Wong. Linear time algorithm for isomorphism of planar graphs. In Proceedings of the 6th A CM Symposium on Theory of Computing, pages 172- 184, 1974.]]

Digital Library

Google Scholar

[18]

J. E. Hopcroft and R. Taxjan. Isomorphism of planar graphs (working paper). In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations. Plenum Press, 1972.]]

Crossref

Google Scholar

[19]

J. E. Hopcroft and R. Tarjan. A vlogv algorithm for isomorphism of triconnected planar graphs. Journal of Computer and System Sciences, 7:323-331, 1973.]]

Digital Library

Google Scholar

[20]

N. Immerman. Descriptive Complexity. Springer-Verlag, 1999.]]

Google Scholar

[21]

N. Immerman and E. Lander. Describing graphs: A first-order approach to graph canonization. In A. Selman, editor, Complexity theory retrospective, pages 59- 81. Springer-Verlag, 1990.]]

Google Scholar

[22]

D. Lichtenstein. Isomorphism for graphs embeddable on the projective plane. In Proceedings of the 12th A CM Symposium on Theory of Computing, pages 218-224, 1980.]]

Digital Library

Google Scholar

[23]

E. Luks. Isomorphism of graphs of bounded valance can be tested in polynomial time. Journal of Computer and System Sciences, 25:42-65, 1982.]]

Crossref

Google Scholar

[24]

G. Miller. Isomorphism of graphs which are pairwise k-separable. Information and Control, 56:21-33, 1983.]]

Crossref

Google Scholar

[25]

G. Miller. Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genus. Information and Control, 56:1-20, 1983.]]

Crossref

Google Scholar

[26]

G. L. Miller. Isomorphism testing for graphs of bounded genus. In Proceedings of the l~th A CM Symposium on Theory of Computing, pages 225-235, 1980.]]

Digital Library

Google Scholar

[27]

B. Mohar. Embedding graphs in an arbitrary surface in linear time. In Proceedings of the 28th A CM Symposium on Theory of Computing, pages 392-397, 1996.]]

Digital Library

Google Scholar

[28]

I. N. Ponomarenko. The isomorphism problem for classes of graphs that are invariant with respect to contraction. Zap. Nauchn. Sere. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI), 174(Teor. Slozhn. Vychisl. 3):147- 177, 182, 1988. In Russian.]]

Google Scholar

[29]

U. SchSning. Graph isomorphism is in the low hierarchy. journal of Computer and System Sciences, 37:312-323, 1988.]]

Digital Library

Google Scholar

[30]

W. Tutte. How to draw a graph. Proceedings of the London Mathematical Society, 13:743-768, 1963.]]

Crossref

Google Scholar

Cited By

View all

Grohe MNeuen D(2023)Canonisation and Definability for Graphs of Bounded Rank WidthACM Transactions on Computational Logic10.1145/356802524:1(1-31)Online publication date: 18-Jan-2023
https://dl.acm.org/doi/10.1145/3568025
van Bergerem SGrohe MKiefer SOeljeklaus L(2023)Simulating Logspace-Recursion with Logarithmic Quantifier Depth2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)10.1109/LICS56636.2023.10175818(1-13)Online publication date: 26-Jun-2023
https://doi.org/10.1109/LICS56636.2023.10175818
Grohe MGorla D(2021)The logic of graph neural networksProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470677(1-17)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470677
Show More Cited By

Index Terms

Isomorphism testing for embeddable graphs through definability
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation
  1. Logic
  2. Randomness, geometry and discrete structures

Recommendations

The subgraph isomorphism problem for outerplanar graphs

This paper deals with the subgraph isomorphism problem for outerplanar graphs (SUBOUTISOM). In general, since trees and forests are outerplanar, SUBOUTISOM is NP-complete. We show that SUBOUTISOM remains NP-complete even when the strongest connectivity ...
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 ...
The uniquely embeddable planar graphs

Whitney [7] proved in 1932 that for any two embeddings of a planar 3-connected graph, their combinatorial duals are isomorphic. In this manner, the term ''uniquely embeddable planar graph'' was introduced. It is a well-known fact that combinatorial and ...

Comments

Information & Contributors

Information

Published In

STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing

May 2000

756 pages

ISBN:1581131844

DOI:10.1145/335305

Chairmen:
Frances Yao,
Eugene Luks

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC00

Sponsor:

SIGACT

STOC00: The 32nd Annual ACM Symposium on Theory of Computing

May 21 - 23, 2000

Oregon, Portland, USA

Acceptance Rates

STOC '00 Paper Acceptance Rate 85 of 182 submissions, 47%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

57
Total Citations
View Citations
591
Total Downloads

Downloads (Last 12 months)32
Downloads (Last 6 weeks)2

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Grohe MNeuen D(2023)Canonisation and Definability for Graphs of Bounded Rank WidthACM Transactions on Computational Logic10.1145/356802524:1(1-31)Online publication date: 18-Jan-2023
https://dl.acm.org/doi/10.1145/3568025
van Bergerem SGrohe MKiefer SOeljeklaus L(2023)Simulating Logspace-Recursion with Logarithmic Quantifier Depth2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)10.1109/LICS56636.2023.10175818(1-13)Online publication date: 26-Jun-2023
https://doi.org/10.1109/LICS56636.2023.10175818
Grohe MGorla D(2021)The logic of graph neural networksProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470677(1-17)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470677
Kiefer S(2020)The Weisfeiler-Leman algorithmACM SIGLOG News10.1145/3436980.34369827:3(5-27)Online publication date: 16-Nov-2020
https://dl.acm.org/doi/10.1145/3436980.3436982
Brachter JSchweitzer PHermanns HZhang LKobayashi NMiller D(2020)On the Weisfeiler-Leman Dimension of Finite GroupsProceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3373718.3394786(287-300)Online publication date: 8-Jul-2020
https://dl.acm.org/doi/10.1145/3373718.3394786
Grohe MNeuen DBouyer P(2019)Canonisation and definability for graphs of bounded rank widthProceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3470152.3470180(1-13)Online publication date: 24-Jun-2019
https://dl.acm.org/doi/10.5555/3470152.3470180
Kiefer SPonomarenko ISchweitzer P(2019)The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3Journal of the ACM10.1145/333300366:6(1-31)Online publication date: 27-Nov-2019
https://dl.acm.org/doi/10.1145/3333003
Grohe MNeuen D(2019)Canonisation and Definability for Graphs of Bounded Rank Width2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)10.1109/LICS.2019.8785682(1-13)Online publication date: Jul-2019
https://doi.org/10.1109/LICS.2019.8785682
Kiefer SPonomarenko ISchweitzer PAceto LIngólfsdóttir A(2017)The weisfeiler-leman dimension of planar graphs is at most 3Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3329995.3330042(1-12)Online publication date: 20-Jun-2017
https://dl.acm.org/doi/10.5555/3329995.3330042
Elberfeld MSchweitzer P(2017)Canonizing Graphs of Bounded Tree Width in LogspaceACM Transactions on Computation Theory10.1145/31327209:3(1-29)Online publication date: 4-Oct-2017
https://dl.acm.org/doi/10.1145/3132720
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Cited By

Index Terms

Recommendations

The subgraph isomorphism problem for outerplanar graphs

Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs

The uniquely embeddable planar graphs

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

The subgraph isomorphism problem for outerplanar graphs

Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs

The uniquely embeddable planar graphs

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations