Knowledge Graph Question Answering (KGQA) systems are based on machine learning algorithms, requiring thousands of question-answer pairs as training examples or natural language processing pipelines that need module fine-tuning. In this paper, we present a novel QA approach, dubbed TeBaQA. Our approach learns to answer questions graph isomorphisms from basic patterns SPARQL queries. Learning is...

While in general it is not known whether there is a polynomial time algorithm to decide whether two given graphs are isomorphic, there are polynomial-time algorithms for certain subsets of graphs, including but not limited to planar graphs and graphs with bounded valence. In this thesis, we will give a brief introduction on the Graph Isomorphism Problem and its relations to complexity theory. W...

Abstract The complexity of graph isomorphism ( GraphIso ) is a famous problem in computer science. For graphs G and H, it asks whether they are the same up to relabeling vertices. In 1981, Lubiw proved that list restricted ListIso NP -complete: for each u ∈ V , we given L ⊆ H possible images u. After 35 years, revive study this consider which results can be modified solve . We prove: 1) Under c...