Odd Induced Subgraphs in Graphs with Treewidth at Most Two.
Xinmin HouLei YuJiaao LiBoyuan LiuPublished in: Graphs Comb. (2018)
Keyphrases
- graph mining
- bounded treewidth
- graph databases
- subgraph isomorphism
- subgraph matching
- labeled graphs
- graph properties
- reachability queries
- graph structures
- subgraph mining
- connected subgraphs
- graph data
- topological information
- maximum common subgraph
- query graph
- frequent subgraphs
- frequent subgraph mining
- boolean functions
- upper bound
- search space
- maximum clique
- graph structure
- directed graph
- graph patterns
- graph matching
- data structure
- space complexity
- graph theoretic
- dense subgraphs
- np complete
- constraint graph
- quasi cliques
- graph kernels
- social networks
- graph theory
- link prediction
- connected components
- decision problems
- social network analysis
- bayesian networks