Subgraph Isomorphism Building on A Hierarchical Query Graph

Author(s):  
Wenjie Zhang ◽  
Wai Kin (Victor) Chan
2021 ◽  
Vol 178 (3) ◽  
pp. 173-185
Author(s):  
Arthur Adinayev ◽  
Itamar Stein

In this paper, we study a certain case of a subgraph isomorphism problem. We consider the Hasse diagram of the lattice Mk (the unique lattice with k + 2 elements and one anti-chain of length k) and find the maximal k for which it is isomorphic to a subgraph of the reduction graph of a given one-rule string rewriting system. We obtain a complete characterization for this problem and show that there is a dichotomy. There are one-rule string rewriting systems for which the maximal such k is 2 and there are cases where there is no maximum. No other intermediate option is possible.


Constraints ◽  
2009 ◽  
Vol 15 (3) ◽  
pp. 327-353 ◽  
Author(s):  
Stéphane Zampelli ◽  
Yves Deville ◽  
Christine Solnon

2021 ◽  
Vol 48 (9) ◽  
pp. 973-980
Author(s):  
Yunyoung Choi ◽  
Kunsoo Park

2016 ◽  
Vol 09 (03) ◽  
pp. 80-90 ◽  
Author(s):  
Yanzhao Liu ◽  
Yinliang Zhao ◽  
Lei Zhang ◽  
Kai Liu

1976 ◽  
Vol 23 (1) ◽  
pp. 31-42 ◽  
Author(s):  
J. R. Ullmann
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document