by M. Dehmer, F. Emmert-Streib, J. Kilian
Reference:
A Similarity Measure for Graphs with Low Computational Complexity (M. Dehmer, F. Emmert-Streib, J. Kilian), In Applied Mathematics and Computation, volume 182, 2006. ()
Bibtex Entry:
@Article{em_j10,
  AUTHOR     = {Dehmer, M. and Emmert-Streib, F. and Kilian, J.},
  YEAR       = {2006},
  TITLE      = {A Similarity Measure for Graphs with Low Computational Complexity},
  JOURNAL    = {Applied Mathematics and Computation},
  volume     = {182},
  number     = {1},
  pages      = {447-459},
  month      = {},
  keywords   = {},
  summary    = {},
  note       = {},
  supersedes = {D-<oldumber>},
  SEMNO      = {D-<newnumber>},
  PUF        = {Artikel optaget i tidsskrift},
  ID         = {Art2},
  OPTweb     = {http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6TY8-4K42BHH-1&_user=1794971&_handle=V-WA-A-W-EA-MsSAYVW-UUW-U-AAZZAWAVZZ-AAZBDUWWZZ-DABUAUED-EA-U&_fmt=summary&_coverDate=11%2F01%2F2006&_rdoc=44&_orig=browse&_srch=%23toc%235612%232006%23998179998%23637276!&_cdi=5612&_acct=C000054599&_version=1&_urlVersion=0&_userid=1794971&md5=677360d60823423c2e02ca53f49bd228},
  OPTCategory =  {BN, ML, O}
}