Faster Swap Edge Computation in Minimum Diameter Spanning Trees (Q3541107)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Faster Swap Edge Computation in Minimum Diameter Spanning Trees	scientific article

Statements

scholarly article

0 references

Faster Swap Edge Computation in Minimum Diameter Spanning Trees (English)

0 references

0 references

Algorithms - ESA 2008

0 references

publication date

25 November 2008

0 references

full work available at URL

http://hdl.handle.net/20.500.11850/69265

0 references

MaRDI profile type

MaRDI publication profile

0 references

Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor

0 references

Computing all the best swap edges distributively

0 references

Fibonacci heaps and their uses in improved network optimization algorithms

0 references

Faster Swap Edge Computation in Minimum Diameter Spanning Trees

0 references

A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree

0 references

Fast Algorithms for Finding Nearest Common Ancestors

0 references

Single backup table schemes for shortest-path routing

0 references

Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures

0 references

Swapping a failing edge of a single source shortest paths tree is good and fast

0 references

The swap edges of a multiple-sources routing tree

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-87744-8_38

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3541107

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3541107&oldid=35082217"