Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs.
Olga MartynovaPublished in: CoRR (2022)
Keyphrases
- graph databases
- graph mining
- graph properties
- labeled graphs
- graph data
- graph representation
- subgraph mining
- graph theory
- worst case
- graph theoretic
- graph structures
- graph structure
- regular expressions
- humanoid robot
- subgraph isomorphism
- frequent subgraph mining
- polynomial time complexity
- maximum clique
- query graph
- computational complexity
- causal graph
- space complexity
- data structure
- graph patterns
- graph clustering
- random walk
- dense subgraphs