Document Open Access Logo

Robustness of Distances and Diameter in a Fragile Network

Authors Arnaud Casteigts , Timothée Corsini , Hervé Hocquard , Arnaud Labourel



PDF
Thumbnail PDF

File

LIPIcs.SAND.2022.9.pdf
  • Filesize: 0.72 MB
  • 16 pages

Document Identifiers

Author Details

Arnaud Casteigts
  • LaBRI, CNRS, Université de Bordeaux, Bordeaux INP, France
Timothée Corsini
  • LaBRI, CNRS, Université de Bordeaux, Bordeaux INP, France
Hervé Hocquard
  • LaBRI, CNRS, Université de Bordeaux, Bordeaux INP, France
Arnaud Labourel
  • Aix Marseille Univ, CNRS, LIS, Marseille, France

Cite AsGet BibTex

Arnaud Casteigts, Timothée Corsini, Hervé Hocquard, and Arnaud Labourel. Robustness of Distances and Diameter in a Fragile Network. In 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 221, pp. 9:1-9:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.SAND.2022.9

Abstract

A property of a graph G is robust if it remains unchanged in all connected spanning subgraphs of G. This form of robustness is motivated by networking contexts where some links eventually fail permanently, and the network keeps being used so long as it is connected. It is then natural to ask how certain properties of the network may be impacted as the network deteriorates. In this paper, we focus on two particular properties, which are the diameter, and pairwise distances among nodes. Surprisingly, the complexities of deciding whether these properties are robust are quite different: deciding the robustness of the diameter is coNP-complete, whereas deciding the robustness of the distance between two given nodes has a linear time complexity. This is counterintuitive, because the diameter consists of the maximum distance over all pairs of nodes, thus one may expect that the robustness of the diameter reduces to testing the robustness of pairwise distances. On the technical side, the difficulty of the diameter is established through a reduction from hamiltonian paths. The linear time algorithm for deciding robustness of the distance relies on a new characterization of two-terminal series-parallel graphs (TTSPs) in terms of excluded rooted minor, which may be of independent interest.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Paths and connectivity problems
  • Networks → Network dynamics
  • Theory of computation → Complexity classes
Keywords
  • Dynamic networks
  • Longest path
  • Series-parallel graphs
  • Rooted minors

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Ingo Althöfer, Gautam Das, David Dobkin, Deborah Joseph, and José Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9(1):81-100, 1993. Google Scholar
  2. Eli Berger, Paul Seymour, and Sophie Spirkl. Finding an induced path that is not a shortest path. Discrete Mathematics, 344(7):112398, 2021. Google Scholar
  3. Arnaud Casteigts, Swan Dubois, Franck Petit, and John M Robson. Robustness: A new form of heredity motivated by dynamic networks. Theoretical Computer Science, 806:429-445, 2020. Google Scholar
  4. R.J Duffin. Topology of series-parallel networks. Journal of Mathematical Analysis and Applications, 10(2):303-318, 1965. Google Scholar
  5. David Eppstein. Parallel recognition of series-parallel graphs. Information and Computation, 98(1):41-55, 1992. Google Scholar
  6. Cyril Gavoille, Quentin Godfroy, and Laurent Viennot. Node-disjoint multipath spanners and their relationship with fault-tolerant spanners. In International Conference On Principles Of Distributed Systems, pages 143-158, 2011. Google Scholar
  7. Frank Harary. Graph Theory. Addison-Wesley Publishing Company, 1st edition, 1969. Google Scholar
  8. John Hopcroft and Robert Tarjan. Algorithm 447: efficient algorithms for graph manipulation. Communications of the ACM, 16(6):372-378, 1973. Google Scholar
  9. Kuo-Hua Kao, Jou-Ming Chang, Yue-Li Wang, and Justie Su-Tzu Juan. A quadratic algorithm for finding next-to-shortest paths in graphs. Algorithmica, 61(2):402-418, 2011. Google Scholar
  10. Ilia Krasikov and Steven D Noble. Finding next-to-shortest paths in a graph. Information processing letters, 92(3):117-119, 2004. Google Scholar
  11. Kumar N Lalgudi and Marios C Papaefthymiou. Computing strictly-second shortest paths. Information processing letters, 63(4):177-181, 1997. Google Scholar
  12. Shisheng Li, Guangzhong Sun, and Guoliang Chen. Improved algorithm for finding next-to-shortest paths. Information processing letters, 99(5):192-194, 2006. Google Scholar
  13. Karl Menger. Zur allgemeinen kurventheorie. Fundamenta Mathematicae, 10(1):96-115, 1927. Google Scholar
  14. John Riordan and Claude E Shannon. The number of two-terminal series-parallel networks. Journal of Mathematics and Physics, 21(1-4):83-93, 1942. Google Scholar
  15. Neil Robertson and Paul D Seymour. Graph minors. xiii. the disjoint paths problem. Journal of combinatorial theory, Series B, 63(1):65-110, 1995. Google Scholar
  16. Jacobo Valdes, Robert E Tarjan, and Eugene L Lawler. The recognition of series parallel digraphs. In Proc. of the 11th ACM Symposium on Theory of Computing, pages 1-12, 1979. Google Scholar
  17. Paul Wollan. Extremal functions for graph linkages and rooted minors. Georgia Institute of Technology, 2005. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail