Skip to main content
SpringerLink
Log in
Book cover

Scandinavian Workshop on Algorithm Theory

SWAT 2002: Algorithm Theory — SWAT 2002 pp 220–229Cite as

Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2368))

Abstract

Dynamic data structures are presented for directed graphs that maintain (a) Transitive Closure and (b) Decomposition into Strongly Connected Components in a “semi-online” situation which improve the static algorithms for minimum sum-of-diameters clustering are improved by a O(log n) factor.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Aspvall, M.F. Plass and R.E. Tarjan. A Linear-time Algorithm for Testing the Truth of Certain Quantified Boolean Expressions, IPL, 8, 1979, pp 121–123.

    Article  MATH  MathSciNet  Google Scholar 

  2. S. Cicerone, D. Frigioni, U Nanni and F Pugliese. A uniform approach to semi-dynamic problems on digraphs, TCS, 203, 1998, pp 69–90.

    Article  MATH  MathSciNet  Google Scholar 

  3. S. R. Doddi, M. V. Marathe, S. S. Ravi, D. S. Taylor and P. Widmayer. Approximation algorithms for clustering to minimize the sum of diameters. In Proc. of 7th SWAT, 2000, LNCS vol 1851, pp 237–250.

    Google Scholar 

  4. C. Demetrescu and G.F. Italiano. Fully Dynamic Transitive Closure: Breaking Through the O(n 2) barrier, 41st IEEE FOCS pp. 381–389.

    Google Scholar 

  5. P. Hansen and B. Jaumard. Minimum Sum of Diameters Clustering, Journal of Classification, 4:215–226, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  6. P. Hansen and B. Jaumard. Cluster analysis and mathematical programming, Mathematical Programming, 79, 1997, pp 191–215.

    MathSciNet  Google Scholar 

  7. S. Khanna, R. Motwani and R.H. Wilson. On certificates and lookahead on dynamic graph problems, Proc 7th ACM-SIAM Symp. Discr. Algthms, 1996, pp222–231.

    Google Scholar 

  8. V. King. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. Proc. 40th IEEE FOCS, 1999.

    Google Scholar 

  9. V. King and G. Sagert. A Fully Dynamic Algorithm for Maintaining the Transitive Closure, ACM STOC 1999, pp 492–498.

    Google Scholar 

  10. C. Monma and S. Suri. Partitioning Points and Graphs to Minimize the Maximum or the Sum of Diameters, Proc. 6th Intl. Conf. on Theory and Applications of Graphs, Kalamazoo, Michigan, May 1989, pp 899–912.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. St Cloud State University, 720, 4th ave S., St Cloud, MN, 56303

    Sarnath Ramnath

Authors
  1. Sarnath Ramnath
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Applied Mathematics, University of Kuopio, P.O. Box 1627, 70211, Kuopio, Finland

    Martti Penttonen

  2. BRICS, University of Aarhus, Department of Computer Science, NY Munkegade, 8000, Aarhus C, Denmark

    Erik Meineche Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ramnath, S. (2002). Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm. In: Penttonen, M., Schmidt, E.M. (eds) Algorithm Theory — SWAT 2002. SWAT 2002. Lecture Notes in Computer Science, vol 2368. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45471-3_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-45471-3_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43866-3

  • Online ISBN: 978-3-540-45471-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation