On resilient graph spanners (Q289925): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(11 intermediate revisions by 8 users not shown)
aliases / en / 0aliases / en / 0
 
On Resilient Graph Spanners
description / endescription / en
scientific article
scientific article; zbMATH DE number 6208835
Property / author
 
Property / author: Paolo Giulio Franciosa / rank
Normal rank
 
Property / title
 
On Resilient Graph Spanners (English)
Property / title: On Resilient Graph Spanners (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1335.68181 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-40450-4_8 / rank
 
Normal rank
Property / author
 
Property / author: Paolo Giulio Franciosa / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
17 September 2013
Timestamp+2013-09-17T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 17 September 2013 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6587985 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6208835 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph algorithms
Property / zbMATH Keywords: graph algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
graph spanners
Property / zbMATH Keywords: graph spanners / rank
 
Normal rank
Property / zbMATH Keywords
 
fault tolerance
Property / zbMATH Keywords: fault tolerance / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithm complexity
Property / zbMATH Keywords: algorithm complexity / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: spanner / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q61609279 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q61609407 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2157278899 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2570721786 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1303.1559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse spanners of weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners in the streaming model: An experimental study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Stretch Spanners on Dynamic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING GRAPH SPANNERS IN SMALL MEMORY: FAULT-TOLERANCE AND STREAMING / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Algorithms for Graph Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive spanners and (α, β)-spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully dynamic randomized algorithms for graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of even length in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault Tolerant Additive Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Additive Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault Tolerant Spanners for General Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Sourcewise and Pairwise Distance Preservers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracles for Distances Avoiding a Failed Node or Link / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Pairs Almost Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of K. Zarankiewicz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:50, 12 July 2024

scientific article; zbMATH DE number 6208835
  • On Resilient Graph Spanners
Language Label Description Also known as
English
On resilient graph spanners
scientific article; zbMATH DE number 6208835
  • On Resilient Graph Spanners

Statements

On resilient graph spanners (English)
0 references
On Resilient Graph Spanners (English)
0 references
0 references
0 references
0 references
0 references
31 May 2016
0 references
17 September 2013
0 references
graph algorithms
0 references
graph spanners
0 references
fault tolerance
0 references
algorithm complexity
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references