On disjoint matchings in cubic graphs: maximum 3-edge-colorable subgraphs
Vahan V. MkrtchyanSamvel S. PetrosyanGagik N. VardanyanPublished in: CoRR (2009)
Keyphrases
- weighted graph
- graph databases
- graph mining
- subgraph isomorphism
- graph properties
- labeled graphs
- subgraph matching
- maximum cardinality
- connected subgraphs
- graph data
- subgraph mining
- reachability queries
- undirected graph
- graph structures
- frequent subgraph mining
- dense subgraphs
- edge detector
- maximum common subgraph
- edge detection
- bipartite graph
- graph matching
- edge information
- frequent subgraphs
- maximum clique
- query graph
- spanning tree
- graph theoretic
- edge weights
- graph patterns
- pattern mining
- maximal cliques
- topological information
- data structure
- image processing
- vertex set
- minimum weight
- minimum spanning trees
- biological networks
- maximum number
- directed graph
- graph clustering
- adjacency graph
- graph representation
- graph model
- structured data
- input image