Vertex partitioning of graphs into odd induced subgraphs.
Arman AashtabSaieed AkbariMaryam GhanbariAmitis ShidaniPublished in: Discuss. Math. Graph Theory (2023)
Keyphrases
- labeled graphs
- connected subgraphs
- graph databases
- vertex set
- graph mining
- subgraph isomorphism
- graph properties
- directed graph
- biological networks
- attributed graphs
- subgraph matching
- undirected graph
- graph data
- graph partitioning
- similarity function
- graph structures
- maximum common subgraph
- frequent subgraph mining
- reachability queries
- subgraph mining
- graph kernels
- directed acyclic graph
- weighted graph
- frequent subgraphs
- connected components
- hamiltonian cycle
- graph matching
- topological information
- dense subgraphs
- graph theoretic
- pattern mining
- partitioning algorithm
- maximum cardinality
- graph structure
- regular expressions
- edge weights
- graph patterns
- minimum weight
- network analysis
- query graph
- graph theory
- spectral graph
- random graphs