Login / Signup

Finding the Set of All Hinge Vertices for Strongly Chordal Graphs in Linear Time.

Jou-Ming ChangChiun-Chieh HsuYue-Li WangTing-Yem Ho
Published in: Inf. Sci. (1997)
Keyphrases
  • undirected graph
  • small number
  • labeled graphs
  • data structure
  • feature selection
  • hierarchical structure
  • directed graph
  • graph structure
  • minimum length
  • independent set