Search results for "edge failures"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Ran Duan, Seth Pettie	Connectivity oracles for failure prone graphs.	STOC	2010	DBLP DOI BibTeX RDF	connectivity
1	Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty	Fault-tolerant spanners for general graphs.	STOC	2009	DBLP DOI BibTeX RDF	fault-tolerance, graphs, spanners
1	Daniel J. Rosenkrantz, Sanjay Goel, S. S. Ravi, Jagdish Gangolly	Resilience Metrics for Service-Oriented Networks: A Service Allocation Approach.	IEEE T. Services Computing	2009	DBLP DOI BibTeX RDF
1	Bing Su, Qingchuan Xu, Peng Xiao	Finding the anti-block vital edge of a shortest path between two nodes.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Edge failures, Anti-block vital edge, Shortest path
1	Qiang Ye, Yuxing Huang, Andrew Reddin, Lei Wang, Wuman Luo	Multi-path GEM for Routing in Wireless Sensor Networks.	WASA	2008	DBLP DOI BibTeX RDF	Sensor Networks, Reliability, Graph Embedding, Multi-Path
1	Petteri Hintsanen, Hannu Toivonen	Finding reliable subgraphs from large probabilistic graphs.	Data Min. Knowl. Discov.	2008	DBLP DOI BibTeX RDF	Link discovery and analysis, Reliability, Graph mining, Graph visualization
1	Petteri Hintsanen	The Most Reliable Subgraph Problem.	PKDD	2007	DBLP DOI BibTeX RDF
1	Sidharth Jaggi, Peter Sanders, Philip A. Chou, Michelle Effros, Sebastian Egner, Kamal Jain, Ludo M. G. M. Tolhuizen	Polynomial time algorithms for multicast network code construction.	IEEE Transactions on Information Theory	2005	DBLP DOI BibTeX RDF
1	Daniel J. Rosenkrantz, Sanjay Goel, S. S. Ravi, Jagdish Gangolly	Structure-Based Resilience Metrics for Service-Oriented Networks.	EDCC	2005	DBLP DOI BibTeX RDF
1	Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz	Building Edge-Failure Resilient Networks.	Algorithmica	2005	DBLP DOI BibTeX RDF	Backup path, Approximation algorithm, Network design, Restoration, Link failure
1	Jon M. Kleinberg, Mark Sandler, Aleksandrs Slivkins	Network failure detection and graph connectivity.	SODA	2004	DBLP DOI BibTeX RDF
1	Enrico Nardelli, Guido Proietti, Peter Widmayer	Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures.	J. Graph Algorithms Appl.	2001	DBLP BibTeX RDF
1	Pierre Hansen, Brigitte Jaumard, Guy-Blaise Douanya Nguetsé	Best Second Order Bounds for Two-terminal Network Reliability with Dependent Edge Failures.	Discrete Applied Mathematics	1999	DBLP DOI BibTeX RDF
1	Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke	Survivable Networks with Bounded Delay: The Edge Failure Case.	ISAAC	1999	DBLP DOI BibTeX RDF
1	Enrico Nardelli, Guido Proietti, Peter Widmayer	Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures.	ESA	1998	DBLP DOI BibTeX RDF
1	Annette Lagman, Walid A. Najjar, Pradip K. Srimani	An Analysis of Edge Fault Tolerance in Recursively Decomposable Regular Networks.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	edge fault tolerance, recursively decomposable, edge failures, fault tolerance measures, restricted resilience, probabilistic fault tolerance measures, reliability, interconnection networks, fault tolerant computing, multiprocessor interconnection networks, network topology, network topologies, resilience, topological properties, regular networks, probabilistic measures, large scale multiprocessor
1	D. H. Smith	Optimally Reliable Graphs for Both Vertex and Edge Failures.	Combinatorics, Probability & Computing	1993	DBLP DOI BibTeX RDF
1	David R. Karger	Random Sampling in Matroids, with Applications to Graph Connectivity and Minimum Spanning Trees	FOCS	1993	DBLP DOI BibTeX RDF	random edge failures, optimization, data structures, connectivity, minimum spanning trees, random sampling, matroids, graph connectivity, greedy methods