An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner (Q5136230): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
label / enlabel / en
 
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.ISAAC.2017.14 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1710.01516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining information in fully dynamic trees with top trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Computation of All the Best Swap Edges of a Tree Spanner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective edge-fault-tolerant single-source spanners via best (or good) swap edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding best swap edges minimizing the routing cost of a spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster computation of all the best swap edges of a shortest paths tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance Approximating Trees for Chordal and Dually Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing All Best Swaps for Minimum-Stretch Tree Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining spanning trees of small diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single backup table schemes for shortest-path routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The zoo of tree spanner problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly linear time minimum spanning tree maintenance for transient node failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: The swap edges of a multiple-sources routing tree / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964019098 / rank
 
Normal rank
Property / title
 
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner (English)
Property / title: An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.ISAAC.2017.14 / rank
 
Normal rank

Latest revision as of 16:04, 30 December 2024

scientific article; zbMATH DE number 7278019
Language Label Description Also known as
English
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
scientific article; zbMATH DE number 7278019

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    25 November 2020
    0 references
    transient edge failure
    0 references
    swap algorithm
    0 references
    tree spanner
    0 references
    An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner (English)
    0 references

    Identifiers