Reconstructing Cactus Graphs from Shortest Path Information

(Extended Abstract)
Conference paper

DOI: 10.1007/978-3-319-41168-2_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9778)
Cite this paper as:
Kranakis E., Krizanc D., Lu Y. (2016) Reconstructing Cactus Graphs from Shortest Path Information. In: Dondi R., Fertin G., Mauri G. (eds) Algorithmic Aspects in Information and Management. AAIM 2016. Lecture Notes in Computer Science, vol 9778. Springer, Cham

Abstract

Imagine a disaster in which all edges of a network go down simultaneously. Imagine further that the routing tables of the nodes were not destroyed but are still available. Can one “reconstruct” the network from the routing tables? This question was first asked by Kranakis, Krizanc and Urrutia in 1995 as part of an attempt to answer the question of how much information about the network is stored in the node routing tables. In this paper, we answer this question in the affirmative if the underlying network is a cactus graph by providing an algorithm that returns all node-labelled cacti consistent with a given set of routing tables. This is the first such result for a class of non-geodetic graphs.

Keywords

Graph reconstruction Shortest path information Cactus graph 

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada
  2. 2.Department of Mathematics and Computer ScienceWesleyan UniversityMiddletownUSA
  3. 3.Department of MathematicsKutztown UniversityKutztownUSA

Personalised recommendations