Network reliability in Hamiltonian graphs
From MaRDI portal
Publication:2234742
DOI10.1016/j.disopt.2021.100645zbMath1506.90081arXiv2005.02848OpenAlexW3163808251WikidataQ114190439 ScholiaQ114190439MaRDI QIDQ2234742
Pol Llagostera, Carles Comas, Nacho López
Publication date: 19 October 2021
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.02848
Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25) Eulerian and Hamiltonian graphs (05C45)
Related Items (2)
Dr. Charles L. Suffel: Scholar, teacher, mentor, friend ⋮ Uniformly optimally reliable graphs: A survey
Cites Work
- The average reliability of a graph
- On the characterization of graphs with maximum number of spanning trees
- A certain polynomial of a graph and graphs with an extremal number of trees
- Advances on the Hamiltonian problem -- a survey
- Sixty years of network reliability
- On the construction of optimally reliable graphs
- Uniformly-most reliable networks do not always exist
- Uniformly optimal digraphs for strongly connected reliability
- On graphs with randomly deleted edges
- A reliability-improving graph transformation with applications to network reliability
- Network Flow and Testing Graph Connectivity
- A proof of Boesch's conjecture
- Maximizing spanning trees in almost complete graphs
- Uniformly optimally reliable graphs
- Handbook of Computational Social Choice
- On the existence of uniformly optimally reliable networks
This page was built for publication: Network reliability in Hamiltonian graphs
