Skip to main content
SpringerLink
Log in

Linear verification for spanning trees

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

Given a rooted tree with values associated with then vertices and a setA of directed paths (queries), we describe an algorithm which finds the maximum value of every one of the given paths, and which uses only

$$5n + n\log \frac{{\left| A \right| + n}}{n}$$

comparisons.

This leads to a spanning tree verification algorithm usingO(n+e) comparisons in a graph withn vertices ande edges.

No implementation is offered.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Cheriton andR. E. Tarjan, Finding Minimum Spanning Trees,SIAM J. on Computing,5 (1976), 724–742.

    Article  MATH  MathSciNet  Google Scholar 

  2. M. Fredman andR. E. Tarjan,private communication, December 1983.

  3. R. L. Graham, A. C. Yao, andF. F. Yao, Information Bounds are Weak in the Shortest Distance Problem,JACM,27 (1980), 428- 444.

    Article  MATH  MathSciNet  Google Scholar 

  4. D. Harel, A Linear Time Algorithm for the Lowest Common Ancestors Problem,Proc. 21st Annual Symp. on Foundations of Computer Science, (1980), 308–319.

  5. R. E. Tarjan, Application of Path Compression on Balanced Trees,JACM,26 (1979), 690–715.

    Article  MATH  MathSciNet  Google Scholar 

  6. A. C. Yao, AnO(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees,Information Processing Letters,4 (1975), 21–23.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute of the Hungarian Academy of Sciences, P.O.B. 127, 1364, Budapest, Hungary

    J. Komlós

  2. University of California, San Diego, 92093, La Jolla, CA, U.S.A.

    J. Komlós

Authors
  1. J. Komlós
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Komlós, J. Linear verification for spanning trees. Combinatorica 5, 57–65 (1985). https://doi.org/10.1007/BF02579443

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02579443

AMS subject classification (1980)

Search

Navigation