New invariants for the graph isomorphism problem
A Gamkrelidze, L Varamashvili, G Hotz - Journal of Mathematical Sciences, 2016 - Springer
A Gamkrelidze, L Varamashvili, G Hotz
Journal of Mathematical Sciences, 2016•SpringerA bstract In this paper, we introduce a novel polynomial-time algorithm to compute graph
invariants based on the idea of a modified random walk on graphs. Though not proved to be
a full graph invariant yet, our method gives the right answer for the graph instances other
well-known methods could not compute (such as special Fürer gadgets and point-line
incidence graphs of finite projective planes of higher degrees).
invariants based on the idea of a modified random walk on graphs. Though not proved to be
a full graph invariant yet, our method gives the right answer for the graph instances other
well-known methods could not compute (such as special Fürer gadgets and point-line
incidence graphs of finite projective planes of higher degrees).
Abstract
In this paper, we introduce a novel polynomial-time algorithm to compute graph invariants based on the idea of a modified random walk on graphs. Though not proved to be a full graph invariant yet, our method gives the right answer for the graph instances other well-known methods could not compute (such as special Fürer gadgets and point-line incidence graphs of finite projective planes of higher degrees).
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果