Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees

Greg N. Frederickson. Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees. In 32nd Annual Symposium on Foundations of Computer Science, 1-4 October 1991, San Juan, Puerto Rico. pages 632-641, IEEE, 1991.

@inproceedings{Frederickson91,
  title = {Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees},
  author = {Greg N. Frederickson},
  year = {1991},
  tags = {data-flow},
  researchr = {https://researchr.org/publication/Frederickson91},
  cites = {0},
  citedby = {0},
  pages = {632-641},
  booktitle = {32nd Annual Symposium on Foundations of Computer Science, 1-4 October 1991, San Juan, Puerto Rico},
  publisher = {IEEE},
}