Login / Signup

Lower Bound on the Minimum Number of Edges in Subgraphs of Johnson Graphs.

Ya. K. Shubin
Published in: Probl. Inf. Transm. (2022)
Keyphrases
  • lower bound
  • undirected graph
  • upper bound
  • small number
  • constant factor
  • spanning tree
  • np hard
  • directed graph
  • branch and bound algorithm
  • minimum cost
  • random graphs
  • graph properties