Polynomial-time algorithm for fixed points of nontrivial morphisms. Holub, Š. Discrete Math., 309(16):5069--5076, 2009.
Polynomial-time algorithm for fixed points of nontrivial morphisms [link]Paper  doi  bibtex   
@Article{MR2548908,
  author     = {Holub, {\v{S}}t{\v{e}}p{\'a}n},
  title      = {Polynomial-time algorithm for fixed points of nontrivial morphisms},
  journal    = {Discrete Math.},
  year       = {2009},
  volume     = {309},
  number     = {16},
  pages      = {5069--5076},
  issn       = {0012-365X},
  coden      = {DSMHA4},
  doi        = {10.1016/j.disc.2009.03.019},
  fjournal   = {Discrete Mathematics},
  mrclass    = {68Q45 (05A05 68Q25)},
  mrnumber   = {2548908},
  mrreviewer = {Dong Yang Long},
  url        = {http://dx.doi.org/10.1016/j.disc.2009.03.019},
}

Downloads: 0