Login / Signup

Finding Longest (s, t)-paths of O-shaped Supergrid Graphs in Linear Time.

Ruo-Wei HungFatemeh Keshavarz-KohjerdiYuh-Min TsengGuo-Hao Qiu
Published in: iCAST (2019)
Keyphrases
  • graph matching
  • graph theory
  • graph model
  • neural network
  • genetic algorithm
  • information systems
  • information retrieval
  • graph mining
  • graph theoretic
  • random graphs
  • maximum clique