Sparse Reliable Graph Backbones

DOI10.1007/978-3-642-14162-1_22zbMath1288.68030OpenAlexW1848344932MaRDI QIDQ3587444

Boaz Patt-Shamir, Yuval Emek, Shiri Chechik, David Peleg

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.7301

zbMATH Keywords

Tutte polynomialnetwork reliabilitysparse subgraphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

Fast sequential importance sampling to estimate the graph reliability polynomial