Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs.
Olga MartynovaPublished in: Inf. Comput. (2024)
Keyphrases
- graph databases
- graph mining
- graph properties
- graph structures
- labeled graphs
- graph theoretic
- maximum clique
- directed graph
- graph structure
- worst case
- graph data
- graph theory
- frequent subgraph mining
- subgraph mining
- computational complexity
- connected subgraphs
- quasi cliques
- subgraph isomorphism
- tree automata
- finite automata
- random walk
- maximal cliques
- turing machine
- graph patterns
- link prediction
- decision problems
- model checking