… See [4], [15], [25] for discussion of this line of investigation in the reconstruction of trees.
Our results on the complexity aspects of the reconstruction of a graph from a subdeck are …

… We investigate the relative complexity of the graph isomorphism problem (GI) and problems
related to the reconstruction of a graph from its vertex-deleted or edge-deleted subgraphs. …

… Our reconstruction algorithm has a very simple structure, and is highly parallelizable. On …
graphs of bounded degree, our reconstruction algorithm has subquadratic query complexity. …

… The original version of this paper showed that GI <~ DC, if the graph reconstruction
conjecture … proof, removed the assumption regarding the graph reconstruction conjecture [KST1]. …

… of expressive graph representations. Secondly, we show how graph reconstruction boosts
… Finally, we show its quadratic number of parameters, exponential computational complexity, …

… We show that the query complexity for reconstruction using a distance … graph reconstruction
algorithm with O(n3/2) betweenness queries by extending our result on graph reconstruction …

… Finally, we develop an accompanied signal reconstruction strategy to reuse the LP graph
filter from sampling. This reconstruction strategy provides a biased estimator with low complex…

… unknown graph, one subgraph per card; can we reconstruct the original graph from this
deck of cards, up to isomorphism? This formulation led naturally to the question of which graph …

… as a focal point of graph theory. This paper considers the computational complexity of decisions
… (PREIMAGE COUNTING) related to the graph reconstruction conjecture. We show that: …

… Our results extend earlier complexity results about isomorphism testing of graphs generated
from … In Section 4, we show that t-designs can be reconstructed from their line graphs in …