HackerPapers

arXiv:1004.1808cs.DS

Polynomial Time Algorithm for Graph Isomorphism Testing

Michael I. Trofimov

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

This article deals with new polynomial time algorithm for graph isomorphism testing.

arXiv comments
20 pages, 7 figures
Journal reference
DOI
Subjects
cs.DSData Structures and Algorithms

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Apr 2010 to Apr 2010. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.