---
_id: '18929'
author:
- first_name: Miroslaw
  full_name: Dynia, Miroslaw
  last_name: Dynia
- first_name: Miroslaw
  full_name: Korzeniowski, Miroslaw
  last_name: Korzeniowski
- first_name: Jarosław
  full_name: Kutyłowski, Jarosław
  last_name: Kutyłowski
citation:
  ama: 'Dynia M, Korzeniowski M, Kutyłowski J. Competitive Maintenance of Minimum
    Spanning Trees in Dynamic Graphs. In: <i>Proc. of the 33rd International Conference
    on Current Trends in Theory and Practice of Computer Science (SOFSEM’07)</i>.
    Vol 4362. ; 2007:260--271. doi:<a href="https://doi.org/10.1007/978-3-540-69507-3_21">10.1007/978-3-540-69507-3_21</a>'
  apa: Dynia, M., Korzeniowski, M., &#38; Kutyłowski, J. (2007). Competitive Maintenance
    of Minimum Spanning Trees in Dynamic Graphs. In <i>Proc. of the 33rd International
    Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07)</i>
    (Vol. 4362, pp. 260--271). <a href="https://doi.org/10.1007/978-3-540-69507-3_21">https://doi.org/10.1007/978-3-540-69507-3_21</a>
  bibtex: '@inproceedings{Dynia_Korzeniowski_Kutyłowski_2007, title={Competitive Maintenance
    of Minimum Spanning Trees in Dynamic Graphs}, volume={4362}, DOI={<a href="https://doi.org/10.1007/978-3-540-69507-3_21">10.1007/978-3-540-69507-3_21</a>},
    booktitle={Proc. of the 33rd International Conference on Current Trends in Theory
    and Practice of Computer Science (SOFSEM’07)}, author={Dynia, Miroslaw and Korzeniowski,
    Miroslaw and Kutyłowski, Jarosław}, year={2007}, pages={260--271} }'
  chicago: Dynia, Miroslaw, Miroslaw Korzeniowski, and Jarosław Kutyłowski. “Competitive
    Maintenance of Minimum Spanning Trees in Dynamic Graphs.” In <i>Proc. of the 33rd
    International Conference on Current Trends in Theory and Practice of Computer
    Science (SOFSEM’07)</i>, 4362:260--271, 2007. <a href="https://doi.org/10.1007/978-3-540-69507-3_21">https://doi.org/10.1007/978-3-540-69507-3_21</a>.
  ieee: M. Dynia, M. Korzeniowski, and J. Kutyłowski, “Competitive Maintenance of
    Minimum Spanning Trees in Dynamic Graphs,” in <i>Proc. of the 33rd International
    Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07)</i>,
    2007, vol. 4362, pp. 260--271.
  mla: Dynia, Miroslaw, et al. “Competitive Maintenance of Minimum Spanning Trees
    in Dynamic Graphs.” <i>Proc. of the 33rd International Conference on Current Trends
    in Theory and Practice of Computer Science (SOFSEM’07)</i>, vol. 4362, 2007, pp.
    260--271, doi:<a href="https://doi.org/10.1007/978-3-540-69507-3_21">10.1007/978-3-540-69507-3_21</a>.
  short: 'M. Dynia, M. Korzeniowski, J. Kutyłowski, in: Proc. of the 33rd International
    Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07),
    2007, pp. 260--271.'
date_created: 2020-09-03T10:29:52Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '63'
doi: 10.1007/978-3-540-69507-3_21
intvolume: '      4362'
language:
- iso: eng
page: 260--271
publication: Proc. of the 33rd International Conference on Current Trends in Theory
  and Practice of Computer Science (SOFSEM'07)
publication_identifier:
  isbn:
  - '9783540695066'
  - '9783540695073'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
type: conference
user_id: '15415'
volume: 4362
year: '2007'
...