Maximum bipartite subgraphs in graphs without short cycles.
Jing LinQinghou ZengPublished in: Discret. Appl. Math. (2022)
Keyphrases
- graph model
- graph mining
- graph databases
- bipartite graph
- subgraph isomorphism
- labeled graphs
- graph partitioning
- subgraph matching
- maximum common subgraph
- graph structures
- reachability queries
- subgraph mining
- graph data
- graph clustering
- frequent subgraph mining
- graph properties
- connected subgraphs
- graph structure
- query graph
- maximum clique
- undirected graph
- data structure
- frequent subgraphs
- real valued
- graph patterns
- dense subgraphs
- directed graph
- graph matching
- graph theory
- vertex set
- maximal cliques
- graph representation
- weighted graph
- search engine
- association graph
- data mining
- edge weights
- graph theoretic