On Complementing Unambiguous Automata and Graphs With Many Cliques and Cocliques.
Emil IndzhevStefan KieferPublished in: CoRR (2021)
Keyphrases
- maximal cliques
- graph structure
- weighted graph
- maximum clique
- finite state machines
- graph theory
- cellular automata
- graph mining
- graph theoretic
- finite automata
- directed graph
- regular expressions
- branch and bound algorithm
- hidden markov models
- genetic algorithm
- random variables
- graphical models
- markov random field
- graph databases