Maximum bipartite subgraphs of Kneser graphs.
Svatopluk PoljakZsolt TuzaPublished in: Graphs Comb. (1987)
Keyphrases
- language model
- graph model
- graph databases
- graph mining
- bipartite graph
- subgraph isomorphism
- graph partitioning
- graph properties
- labeled graphs
- connected subgraphs
- query graph
- graph structures
- maximum common subgraph
- reachability queries
- subgraph matching
- undirected graph
- graph data
- subgraph mining
- graph representation
- graph theoretic
- maximum clique
- graph patterns
- frequent subgraph mining
- real valued
- vertex set
- graph matching
- graph structure
- quasi cliques
- dense subgraphs
- maximal cliques
- graph theory
- information retrieval
- frequent subgraphs
- pattern mining
- probabilistic model
- topological information
- edit distance
- directed graph
- graph clustering
- connected components
- data structure
- similarity measure
- link analysis
- social networks