Concepedia

The isomorphism problem for classes of graphs closed under contraction

Ilia Ponomarenko

Journal of Mathematical Sciences · 1991 · 56 citations · 9 references

DOI

Concepts

References

9

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

John E. Hopcroft, Richard M. Karp · SIAM Journal on Computing · 1973 · 2.8K citations

, , +15

Canonical labeling of graphs

László Babai, Eugene M. Luks · 1983 · 414 citations · Full text

, , +17

Polynomial-time algorithms for permutation groups

Merrick L. Furst, John E. Hopcroft, Eugene M. Luks · 1980 · 252 citations

, , +14

A Linear Time Algorithm for Deciding Interval Graph Isomorphism

George S. Lueker, Kellogg S. Booth · Journal of the ACM · 1979 · 196 citations · Full text

, , +6

A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus

I. S. Filotti, Jack N. Mayer · 1980 · 111 citations · Full text

, , +15