Login / Signup

Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs.

William Y. C. ChenXueliang LiChao WangXiaoyan Zhang
Published in: Electron. Notes Discret. Math. (2004)
Keyphrases
  • computationally efficient
  • orders of magnitude
  • graph theory
  • learning algorithm
  • computational cost
  • significant improvement
  • times faster
  • machine learning
  • genetic algorithm
  • upper bound
  • graph matching
  • graph model