Login / Signup

Improved bound on the oriented diameter of graphs with given minimum degree.

Michel Surmacs
Published in: Eur. J. Comb. (2017)
Keyphrases
  • spanning tree
  • maximum distance
  • lower bound
  • upper bound
  • graph matching
  • graph theory
  • worst case
  • minimum cost
  • random graphs
  • genetic algorithm
  • case study
  • graph structure
  • graph representation
  • connected dominating set