2000/05/01 by Mikkel Thorup · 199 citations
Computer Science · Mathematics · #Citation #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Distributed systems and fault tolerance #Graph #Graph theory #Interconnection Networks and Systems #Mathematics #Theoretical computer science #World Wide Web
paper · doi:10.1145/335305.335345
openalex publication_date 2000/05/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
Article Free Access Share on Near-optimal fully-dynamic graph connectivity Author: Mikkel Thorup AT&T Labs--Research, Shannon Laboratory, 180 Park Avenue, Florham Park, NJ AT&T Labs--Research, Shannon Laboratory, 180 Park Avenue, Florham Park, NJView Profile Authors Info & Claims STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computingMay 2000 Pages 343–35010.1145/335305.335345Published:01 May 2000Publication History 121citation2,192DownloadsMetricsTotal Citations121Total Downloads2,192Last 12 Months234Last 6 weeks88 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF