Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs.
Robert BrignallHo-Jin ChoiJisu JeongSang-il OumPublished in: CoRR (2016)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- graph properties
- labeled graphs
- subgraph matching
- graph data
- reachability queries
- connected subgraphs
- subgraph mining
- maximum common subgraph
- graph structures
- frequent subgraphs
- maximum clique
- topological information
- graph matching
- graph patterns
- frequent subgraph mining
- dense subgraphs
- finite number
- query graph
- graph theory
- biological networks
- undirected graph
- quasi cliques
- graph theoretic
- graph model
- data objects
- pattern discovery
- graph representation
- maximal cliques
- query language