Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS.
Alexander E. AndreevAndrea E. F. ClementiJosé D. P. RolimPublished in: Theor. Comput. Sci. (1996)
Keyphrases
- graph mining
- graph databases
- subgraph matching
- graph classification
- subgraph isomorphism
- graph data
- graph properties
- labeled graphs
- quasi cliques
- random graphs
- dense subgraphs
- connected subgraphs
- frequent subgraph mining
- subgraph mining
- graph matching
- graph search
- maximum clique
- graph structures
- graph theoretic
- clustering coefficient
- frequent subgraphs
- query graph
- shortest path
- power law
- graph representation
- graph model
- graph theory
- directed graph
- social network analysis