Graph invariant from ideas in quantum field theory

An Huang Shing-Tung Yau

Mathematical Physics mathscidoc:1912.43712

arXiv preprint arXiv:1409.5853, 2014.9
We propose a polynomial time computable graph invariant, which comes out directly from a modified version of discrete Greens function on a graph. It is our hope that it can help to construct fast algorithms for the graph isomorphism testing. We explain the physics behind this discrete Greens function, which is a very basic idea applied to graphs.
No keywords uploaded!
[ Download ] [ 2019-12-24 20:51:49 uploaded by yaust ] [ 575 downloads ] [ 0 comments ]
@inproceedings{an2014graph,
  title={Graph invariant from ideas in quantum field theory},
  author={An Huang, and Shing-Tung Yau},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20191224205149036386276},
  booktitle={arXiv preprint arXiv:1409.5853},
  year={2014},
}
An Huang, and Shing-Tung Yau. Graph invariant from ideas in quantum field theory. 2014. In arXiv preprint arXiv:1409.5853. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20191224205149036386276.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved