Corpus ID: 46380449

Trivalen graph isomorphism in polynomial time

@article{Mena2012TrivalenGI,
  title={Trivalen graph isomorphism in polynomial time},
  author={A. Mena},
  journal={arXiv: Discrete Mathematics},
  year={2012}
}
  • A. Mena
  • Published 2012
  • Mathematics, Computer Science
  • arXiv: Discrete Mathematics
It's important to design polynomial time algorithms to test if two graphs are isomorphic at least for some special classes of graphs. An approach to this was presented by Eugene M. Luks(1981) in the work \textit{Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time}. Unfortunately, it was a theoretical algorithm and was very difficult to put into practice. On the other hand, there is no known implementation of the algorithm, although Galil, Hoffman and Luks(1983) shows an… Expand
1 Citations
Belief propagation in monoidal categories
  • 6
  • PDF

References

SHOWING 1-10 OF 20 REFERENCES
Isomorphism of graphs of bounded valence can be tested in polynomial time
  • E. Luks
  • Computer Science, Mathematics
  • 21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
  • 1980
  • 520
  • Highly Influential
  • PDF
Canonical labeling of graphs
  • 395
  • PDF
Solvability by radicals is in polynomial time
  • 56
  • PDF
The Design and Analysis of Computer Algorithms
  • 9,244
  • PDF
A Course in Group Theory
  • 218
A compact representation for permutation groups
  • M. Jerrum
  • Mathematics, Computer Science
  • 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
  • 1982
  • 72
The paradox of overfitting
  • 14
  • PDF
Introduction to Algorithms
  • 7,957
  • PDF
...
1
2
...