You are currently offline. Some features of the site may not work correctly.

Corpus ID: 212675410

Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata

@article{Wolf2020RegularIE,
title={Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata},
author={P. Wolf and H. Fernau},
journal={ArXiv},
year={2020},
volume={abs/2003.05826}
}

The Int_reg-problem of a combinatorial problem P asks, given a nondeterministic automaton M as input, whether the language L(M) accepted by M contains any positive instance of the problem P. We consider the Int_reg-problem for a number of different graph problems and give general criteria that give decision procedures for these Int_reg-problems. To achieve this goal, we consider a natural graph encoding so that the language of all graph encodings is regular. Then, we draw the connection betweenâ€¦Â CONTINUE READING