Login / Signup

Nordhaus-Gaddum-Type Theorem for Diameter of Graphs when Decomposing into Many Parts.

Zhihua AnBaoyindureng WuDaobin LiYun WangGuifu Su
Published in: Discret. Math. Algorithms Appl. (2011)
Keyphrases
  • graph model
  • feature selection
  • graph matching
  • graph theoretic
  • information retrieval
  • information systems
  • search algorithm
  • pattern recognition
  • multiple types
  • graph clustering
  • structured objects