Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
vertex failures
Description:
Failures or removals of vertices in a graph, considered when analyzing network reliability and fault tolerance.
Primary topic:
Complexity and Algorithms in Graphs (51%)
Related topics:
Complexity and Algorithms in Graphs (51%),
Reliability and Maintenance Optimization (16%),
Interconnection Networks and Systems (10%),
Advanced Graph Theory Research (9%)
OpenAlex ID:
keywords/vertex-failures
The capacitated vehicle routing problem with stochastic demands and time windows
2011
·
Hongtao Lei
, Gilbert Laporte
, et al.
·
Computers & Operations Research
·
170
Fault-tolerant spanners: better and simpler
2011
·
Michael Dinitz
, Robert Krauthgamer
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
126
Factoring and reductions for networks with imperfect vertices
1991
·
O.R. Theologou
, J.G. Carlier
·
IEEE Transactions on Reliability
·
113
Efficient and Exact Reliability Evaluation for Networks With Imperfect Vertices
2007
·
Sy-Yen Kuo
, Fu-Min Yeh
, et al.
·
IEEE Transactions on Reliability
·
98
Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication
2013
·
Oren Weimann
, Raphael Yuster
·
ACM Transactions on Algorithms
·
81
Fault-tolerant spanners for general graphs
2009
·
S. Chechik
, M. Langberg
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
81
The extra connectivity of bubble-sort star graphs
2016
·
Jia Guo
, Mei Lu
·
Theoretical Computer Science
·
63
PDF
Fault tolerant subgraph for single source reachability: generic and optimal
2016
·
Surender Baswana
, Keerti Choudhary
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
42
On conditional fault tolerance and diagnosability of hierarchical cubic networks
2015
·
Shuming Zhou
, Sulin Song
, et al.
·
Theoretical Computer Science
·
41
PDF
An Optimal Dual Fault Tolerant Reachability Oracle
2016
·
Choudhary, Keerti
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
40
PDF
Improved Purely Additive Fault-Tolerant Spanners
2015
·
Davide Bilò
, Fabrizio Grandoni
, et al.
·
Lecture notes in computer science
·
39
Strong Connectivity in Directed Graphs under Failures, with Applications
2020
·
Loukas Georgiadis
, Giuseppe F. Italiano
, et al.
·
SIAM Journal on Computing
·
38
Maximizing Expectation on Vertex-Disjoint Cycle Packing
2014
·
João Pedro Pedroso
·
Lecture notes in computer science
·
38
Fault Tolerant Approximate BFS Structures
2013
·
Merav Parter
, David Peleg
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
37
Connectivity Oracles for Graphs Subject to Vertex Failures
2020
·
Ran Duan
, Seth Pettie
·
SIAM Journal on Computing
·
36
PDF
Residual Closeness in Cycles and Related Networks
2013
·
Zeynep Nihan Odabaş
, Aysun Aytaç
·
Fundamenta Informaticae
·
36
Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures
2021
·
Pilipczuk, Michał
, Schirrmacher, Nicole
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
35
PDF
Vertex Fault Tolerant Additive Spanners
2014
·
Merav Parter
·
Lecture notes in computer science
·
34
Replacement Paths via Fast Matrix Multiplication
2010
·
Oren Weimann
, Raphael Yuster
·
Annual Symposium on Foundations of Computer Science
·
34
A Note on the Complexity of Network Reliability Problems
2004
·
Hans L. Bodlaender
, Thomas Wolle
·
Utrecht University Repository (Utrecht University)
·
34
Fault-Tolerant Spanners: Better and Simpler
2011
·
Dinitz, Michael
, Krauthgamer, Robert
·
arXiv (Cornell University)
·
32
PDF
Nearly optimal vertex fault-tolerant spanners in optimal time: sequential, distributed, and parallel
2022
·
Merav Parter
·
ACM Symposium on Theory of Computing (STOC)
·
29
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs
2010
·
Khanna, Neelesh
, Baswana, Surender
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
29
PDF
Robustness of Regular Caterpillars
2017
·
Aysun Aytaç
, Zeynep Nihan Odabaş Berberler
·
International Journal of Foundations of Computer Science
·
28
Connectivity Oracles for Graphs Subject to Vertex Failures
2017
·
Ran Duan
, Seth Pettie
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
28
Show more works
View as search
Works count:
127
Citation count:
2,013
Year
Topic
Type