title

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs | Combinatorica

charset

UTF-8

X-UA-Compatible

IE=edge

applicable-device

pc,mobile

viewport

width=device-width, initial-scale=1

og:url

https://link.springer.com/article/10.1007/BF02579168

og:type

article

og:site_name

SpringerLink

og:title

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs - Combinatorica

og:description

Recently, Fredman and Tarjan invented a new, especially efficient form of heap (priority queue). Their data structure, theFibonacci heap (or F-heap) supports arbitrary deletion inO(logn) amortized time and other heap operations inO(1) amortized time. In this paper we use F-heaps to obtain fast algorithms for finding minimum spanning trees in undirected and directed graphs. For an undirected graph containingn vertices andm edges, our minimum spanning tree algorithm runs inO(m logβ (m, n)) time, improved fromO(mβ(m, n)) time, whereβ(m, n)=min {i|log(i) n ≦m/n}. Our minimum spanning tree algorithm for directed graphs runs inO(n logn + m) time, improved fromO(n log n +m log log log(m/n+2) n). Both algorithms can be extended to allow a degree constraint at one vertex.

twitter:site

@SpringerLink

twitter:card

summary_large_image

twitter:image:alt

Content cover image

twitter:title

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

twitter:description

Combinatorica - Recently, Fredman and Tarjan invented a new, especially efficient form of heap (priority queue). Their data structure, theFibonacci heap (or F-heap) supports arbitrary deletion...

position

1

position

2

position

3

apple-touch-icon

/oscar-static/img/favicons/darwin/apple-touch-icon-6ef0829b9c.png

canonical

https://link.springer.com/article/10.1007/BF02579168

icon

/oscar-static/img/favicons/darwin/android-chrome-192x192.png

icon

/oscar-static/img/favicons/darwin/favicon-32x32.png

icon

/oscar-static/img/favicons/darwin/favicon-16x16.png