Logical complexity of induced subgraph isomorphism for certain graph families

2021 ◽  
Vol 212 (4) ◽  
Author(s):  
Maksim Evgen'evich Zhukovskii ◽  
Eremei Denisovich Kudryavtsev ◽  
Mikhail Vladimirovich Makarov ◽  
Aleksandra Sergeevna Shlychkova
Keyword(s):  
Subgraph Isomorphism ◽  
Induced Subgraph ◽  
Graph Families

scholarly journals Classes of graphs with restricted interval models

1999 ◽  
Vol Vol. 3 no. 4 ◽  
Author(s):  
Andrzej Proskurowski ◽  
Jan Arne Telle
Keyword(s):  
Maximum Clique ◽  
Interval Graphs ◽  
Induced Subgraph ◽  
Graph Theoretic ◽  
Graph Classes ◽  
International Audience ◽  
Forbidden Induced Subgraph ◽  
Nested Hierarchy ◽  
Graph Families

International audience We introduce q-proper interval graphs as interval graphs with interval models in which no interval is properly contained in more than q other intervals, and also provide a forbidden induced subgraph characterization of this class of graphs. We initiate a graph-theoretic study of subgraphs of q-proper interval graphs with maximum clique size k+1 and give an equivalent characterization of these graphs by restricted path-decomposition. By allowing the parameter q to vary from 0 to k, we obtain a nested hierarchy of graph families, from graphs of bandwidth at most k to graphs of pathwidth at most k. Allowing both parameters to vary, we have an infinite lattice of graph classes ordered by containment.

scholarly journals On the complexity of various parameterizations of common induced subgraph isomorphism

2017 ◽  
Vol 697 ◽  
pp. 69-78 ◽  
Author(s):  
Faisal N. Abu-Khzam ◽  
Édouard Bonnet ◽  
Florian Sikora
Keyword(s):  
Subgraph Isomorphism ◽  
Induced Subgraph

scholarly journals Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs

2015 ◽  
Vol 562 ◽  
pp. 252-269 ◽  
Author(s):  
Pinar Heggernes ◽  
Pim van 't Hof ◽  
Daniel Meister ◽  
Yngve Villanger
Keyword(s):  
Subgraph Isomorphism ◽  
Induced Subgraph ◽  
Permutation Graphs ◽  
Bipartite Permutation Graphs

scholarly journals A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems

2020 ◽  
Vol 34 (03) ◽  
pp. 2392-2399
Author(s):  
Yanli Liu ◽  
Chu-Min Li ◽  
Hua Jiang ◽  
Kun He
Keyword(s):  
Reinforcement Learning ◽  
Branch And Bound ◽  
Search Tree ◽  
Tree Size ◽  
Experimental Results ◽  
Subgraph Isomorphism ◽  
Connected Subgraph ◽  
Induced Subgraph ◽  
Maximum Common Subgraph ◽  
Tree Leaf

The performance of a branch-and-bound (BnB) algorithm for maximum common subgraph (MCS) problem and its related problems, like maximum common connected subgraph (MCCS) and induced Subgraph Isomorphism (SI), crucially depends on the branching heuristic. We propose a branching heuristic inspired from reinforcement learning with a goal of reaching a tree leaf as early as possible to greatly reduce the search tree size. Experimental results show that the proposed heuristic consistently and significantly improves the current best BnB algorithm for the MCS, MCCS and SI problems. An analysis is carried out to give insight on why and how reinforcement learning is useful in the new branching heuristic.

scholarly journals Mapping Induced Subgraph Isomorphism Problems to Ising Models and Its Evaluations by an Ising Machine

2021 ◽  
Vol E104.D (4) ◽  
pp. 481-489
Author(s):  
Natsuhito YOSHIMURA ◽  
Masashi TAWADA ◽  
Shu TANAKA ◽  
Junya ARAI ◽  
Satoshi YAGI ◽  
...  
Keyword(s):  
Ising Models ◽  
Subgraph Isomorphism ◽  
Induced Subgraph

scholarly journals Induced subgraph isomorphism: Are some patterns substantially easier than others?

2015 ◽  
Vol 605 ◽  
pp. 119-128 ◽  
Author(s):  
Peter Floderus ◽  
Mirosław Kowaluk ◽  
Andrzej Lingas ◽  
Eva-Marta Lundell
Keyword(s):  
Subgraph Isomorphism ◽  
Induced Subgraph
Sign in / Sign up

Export Citation Format

Share Document