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

03/12/2020
by   Petra Wolf, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/17/2019

The intersection of two vertex coloring problems

A hole is an induced cycle with at least four vertices. A hole is even i...
research
09/05/2023

Sparse Partitioning Around Medoids

Partitioning Around Medoids (PAM, k-Medoids) is a popular clustering tec...
research
07/23/2018

Toward a language-theoretic foundation for planning and filtering

We address problems underlying the algorithmic question of automating th...
research
08/12/2019

Regular Separability and Intersection Emptiness are Independent Problems

The problem of regular separability asks, given two languages K and L, w...
research
10/08/2022

Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems

We consider general computational models: one-way and two-way finite aut...
research
03/28/2018

Using symbolic computation to prove nonexistence of distance-regular graphs

A package for the Sage computer algebra system is developed for checking...
research
09/05/2019

Gradient Descent based Weight Learning for Grouping Problems: Application on Graph Coloring and Equitable Graph Coloring

A grouping problem involves partitioning a set of items into mutually di...

Please sign up or login with your details

Forgot password? Click here to reset