Login / Signup

On constructible graphs, infinite bridged graphs and weakly cop-win graphs.

Marc ChastandFrançois LavioletteNorbert Polat
Published in: Discret. Math. (2000)
Keyphrases
  • graph theoretic
  • graph matching
  • graph structure
  • weighted graph
  • graph representation
  • data sets
  • genetic algorithm
  • object recognition
  • directed graph
  • graph model
  • complex structures
  • graph partitioning
  • series parallel