---
res:
  bibo_abstract:
  - We present the first fully dynamic algorithm for maintaining a minimum spanning
    tree in time o(√n) per operation. To be precise, the algorithm uses O(n 1/3 log
    n) amortized time per update operation. The algorithm is fairly simple and deterministic.
    An immediate consequence is the first fully dynamic deterministic algorithm for
    maintaining connectivity and, bipartiteness in amortized time O(n 1/3 log n) per
    update, with O(1) worst case time per query.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Monika H
      foaf_name: Henzinger, Monika H
      foaf_surname: Henzinger
      foaf_workInfoHomepage: http://www.librecat.org/personId=540c9bbd-f2de-11ec-812d-d04a5be85630
    orcid: 0000-0002-5008-6530
  - foaf_Person:
      foaf_givenName: Valerie
      foaf_name: King, Valerie
      foaf_surname: King
  bibo_doi: 10.1007/3-540-63165-8_214
  bibo_volume: 1256
  dct_date: 1997^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0302-9743
  - http://id.crossref.org/issn/1611-3349
  - http://id.crossref.org/issn/9783540631651
  dct_language: eng
  dct_publisher: Springer Nature@
  dct_title: Maintaining minimum spanning trees in dynamic graphs@
...