Vertex partition of a complete multipartite graph into two kinds of induced subgraphs.
Tomoki NakamigawaPublished in: Discret. Math. (2010)
Keyphrases
- labeled graphs
- vertex set
- connected subgraphs
- directed graph
- graph properties
- graph databases
- graph mining
- bipartite graph
- weighted graph
- graph data
- subgraph mining
- minimum weight
- undirected graph
- similarity function
- graph structures
- hamiltonian cycle
- query graph
- frequent subgraph mining
- edge weights
- partitioning algorithm
- graph theory
- graph patterns
- frequent subgraphs
- reachability queries
- graph structure
- regular expressions
- subgraph isomorphism
- connected components
- subgraph matching
- attributed graphs
- directed acyclic graph
- graph model
- average degree
- data structure
- pattern mining
- topological information
- quasi cliques
- maximum cardinality
- normalized cut
- spanning tree
- structured data
- random walk