Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices.
Kazuhiro KuritaKunihiro WasaHiroki ArimuraTakeaki UnoPublished in: CoRR (2019)
Keyphrases
- fixed number
- labeled graphs
- connected subgraphs
- graph mining
- query graph
- subgraph isomorphism
- maximal cliques
- weighted graph
- graph databases
- attributed graphs
- search tree
- random graphs
- subgraph matching
- maximum clique
- graph properties
- finite number
- subgraph mining
- connected components
- graph data
- reachability queries
- graph kernels
- partial ordering
- frequent subgraphs
- biological networks
- frequent subgraph mining
- graph structures
- graph patterns
- maximum common subgraph
- search space
- regular expressions
- undirected graph
- directed acyclic graph
- adjacency matrix
- hamiltonian cycle
- worst case
- pattern mining
- graph matching
- graph model
- edge weights
- data structure
- graph theoretic
- dense subgraphs
- protein interaction networks
- directed edges
- binary search trees