Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching.
Stavros D. NikolopoulosLeonidas PaliosPublished in: Panhellenic Conference on Informatics (2005)
Keyphrases
- subgraph isomorphism
- graph matching
- maximum clique
- association graph
- graph mining
- maximal cliques
- graph databases
- matching algorithm
- subgraph mining
- subgraph matching
- labeled graphs
- graph properties
- maximum number
- maximum common subgraph
- reachability queries
- topological information
- graph data
- sparse data
- maximum cardinality
- graph structures
- graph theoretic
- matching process
- graph theory
- directed graph
- pattern matching
- gaussian graphical models
- graph search
- bounded treewidth
- data structure
- spanning tree
- edit distance
- high dimensional