Login / Signup

Decreasing the diameter of bounded degree graphs.

Noga AlonAndrás GyárfásMiklós Ruszinkó
Published in: J. Graph Theory (2000)
Keyphrases
  • bounded degree
  • graph theoretic
  • bounded treewidth
  • directed graph
  • graph matching
  • graph databases
  • information retrieval
  • prior knowledge
  • np complete
  • decision problems
  • graph structure