"Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in ..."

Sotiris E. Nikoletseas et al. (1995)

> Home

Details and statistics

DOI: 10.1007/3-540-60084-1_71

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icalp/NikoletseasRSY95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/NikoletseasRSY95
Sotiris E. Nikoletseas, John H. Reif, Paul G. Spirakis, Moti Yung:
Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time. ICALP 1995: 159-170

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.