A Family of Trivalent 1-Hamiltonia Graphs With Diameter O(log n).
Jeng-Jung WangTing-Yi SungLih-Hsing HsuPublished in: J. Inf. Sci. Eng. (2001)
Keyphrases
- graph matching
- special case
- worst case
- average degree
- graph theoretic
- graph representation
- graph mining
- directed graph
- graph theory
- graph clustering
- data sets
- lower bound
- object recognition
- real time
- learning algorithm
- series parallel
- structured objects
- weighted graph
- computational complexity
- spanning tree
- graph partitioning
- data structure
- information systems
- subgraph isomorphism