On complementing unambiguous automata and graphs with many cliques and cocliques.
Emil IndzhevStefan KieferPublished in: Inf. Process. Lett. (2022)
Keyphrases
- maximal cliques
- graph structure
- weighted graph
- maximum clique
- cellular automata
- graph databases
- graph matching
- functional modules
- finite automata
- random variables
- protein interaction networks
- graph construction
- graph clustering
- finite state
- directed graph
- series parallel
- graph theoretic
- association graph
- neural network