|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
25 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata | | Petra Wolf
; Henning Fernau
; | | Date: |
12 Mar 2020 | | Abstract: | 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 classical
pumping- and interchange-arguments from the field of formal language theory
with the graph operations induced on the encoded graph. Our techniques apply
among others to the Int_reg-problem of well-known graph problems like Vertex
Cover and Independent Set, as well as to subgraph problems, graph-edit problems
and graph-partitioning problems, including coloring problems. | | Source: | arXiv, 2003.5826 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER