Maximum Motif Problem in Vertex-Colored Graphs.
Riccardo DondiGuillaume FertinStéphane VialettePublished in: CPM (2009)
Keyphrases
- undirected graph
- directed graph
- labeled graphs
- hamiltonian cycle
- attributed graphs
- edge weights
- graph matching
- maximum cardinality
- connected subgraphs
- average degree
- graph theoretic
- graph clustering
- series parallel
- graph structures
- minimum weight
- vertex set
- data mining
- maximum number
- graph mining
- weighted graph
- graph structure
- graph theory
- bipartite graph
- graph partitioning
- spanning tree
- variable length
- data sets