Graph Complexity from the Jensen-Shannon Divergence

Lu Bai, Edwin R. Hancock. Graph Complexity from the Jensen-Shannon Divergence. In Georgy L. Gimel'farb, Edwin R. Hancock, Atsushi Imiya, Arjan Kuijper, Mineichi Kudo, Shinichiro Omachi, Terry Windeatt, Keiji Yamada, editors, Structural, Syntactic, and Statistical Pattern Recognition - Joint IAPR International Workshop, SSPR&SPR 2012, Hiroshima, Japan, November 7-9, 2012. Proceedings. Volume 7626 of Lecture Notes in Computer Science, pages 79-88, Springer, 2012. [doi]

@inproceedings{BaiH12,
  title = {Graph Complexity from the Jensen-Shannon Divergence},
  author = {Lu Bai and Edwin R. Hancock},
  year = {2012},
  doi = {10.1007/978-3-642-34166-3_9},
  url = {http://dx.doi.org/10.1007/978-3-642-34166-3_9},
  researchr = {https://researchr.org/publication/BaiH12},
  cites = {0},
  citedby = {0},
  pages = {79-88},
  booktitle = {Structural, Syntactic, and Statistical Pattern Recognition - Joint IAPR International Workshop, SSPR&SPR 2012, Hiroshima, Japan, November 7-9, 2012. Proceedings},
  editor = {Georgy L. Gimel'farb and Edwin R. Hancock and Atsushi Imiya and Arjan Kuijper and Mineichi Kudo and Shinichiro Omachi and Terry Windeatt and Keiji Yamada},
  volume = {7626},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-34165-6},
}