Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
PGT-I: Scaling Spatiotemporal GNNs with Memory-Efficient Distributed Training
Demystifying Distributed Training of Graph Neural Networks for Link Prediction
DistMLIP: A Distributed Inference Platform for Machine Learning Interatomic Potentials
Hierarchical Superpixel Segmentation via Structural Information Theory
FairGP: A Scalable and Fair Graph Transformer Using Graph Partitioning
Towards the efficacy of federated prediction for epidemics on networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.