AbstractFor a graph G, we are interested in a minimum-size subgraph of G which, along with an unlabelled copy of G, provides enough information to reconstruct G. We perform a preliminary study of such subgraphs, focusing on the cases where G is a complete tree or a grid
We study subgraph isomorphism on graph classes defined by a fixed forbidden graph. Although there ar...
We study subgraph isomorphism on graph classes defined by a fixed forbidden graph. Although there ar...
ABSTRACT. A procedure for determining whether two graphs are isomorphic is described. During the pro...
AbstractFor a graph G, we are interested in a minimum-size subgraph of G which, along with an unlabe...
Link to journal home page http://www.sciencedirect.com/science/journal/0012365XFor a graph G, we ar...
grantor: University of TorontoAn isomorphism certificate (I.C.) for a graph is a set of la...
grantor: University of TorontoAn isomorphism certificate (I.C.) for a graph is a set of la...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
This paper identifies a condition for which the existence of an isomorphic subgraph can be decided i...
AbstractAn open question is the computational complexity of recognizing when two graphs are isomorph...
We study Subgraph Isomorphism on graph classes defined by a fixed forbidden graph. Although there ar...
We study Subgraph Isomorphism on graph classes defined by a fixed forbidden graph. Although there ar...
We study Subgraph Isomorphism on graph classes defined by a fixed forbidden graph. Although there ar...
AbstractWe investigate the relative complexity of the graph isomorphism problem (GI) and problems re...
AbstractThe subgraph isomorphism problem, that of finding a copy of one graph in another, has proved...
We study subgraph isomorphism on graph classes defined by a fixed forbidden graph. Although there ar...
We study subgraph isomorphism on graph classes defined by a fixed forbidden graph. Although there ar...
ABSTRACT. A procedure for determining whether two graphs are isomorphic is described. During the pro...
AbstractFor a graph G, we are interested in a minimum-size subgraph of G which, along with an unlabe...
Link to journal home page http://www.sciencedirect.com/science/journal/0012365XFor a graph G, we ar...
grantor: University of TorontoAn isomorphism certificate (I.C.) for a graph is a set of la...
grantor: University of TorontoAn isomorphism certificate (I.C.) for a graph is a set of la...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
This paper identifies a condition for which the existence of an isomorphic subgraph can be decided i...
AbstractAn open question is the computational complexity of recognizing when two graphs are isomorph...
We study Subgraph Isomorphism on graph classes defined by a fixed forbidden graph. Although there ar...
We study Subgraph Isomorphism on graph classes defined by a fixed forbidden graph. Although there ar...
We study Subgraph Isomorphism on graph classes defined by a fixed forbidden graph. Although there ar...
AbstractWe investigate the relative complexity of the graph isomorphism problem (GI) and problems re...
AbstractThe subgraph isomorphism problem, that of finding a copy of one graph in another, has proved...
We study subgraph isomorphism on graph classes defined by a fixed forbidden graph. Although there ar...
We study subgraph isomorphism on graph classes defined by a fixed forbidden graph. Although there ar...
ABSTRACT. A procedure for determining whether two graphs are isomorphic is described. During the pro...
DOI
Add to ORKG