An On-Line Edge-Deletion Problem

@article{Even1981AnOE,
  title={An On-Line Edge-Deletion Problem},
  author={Shimon Even and Yossi Shiloach},
  journal={J. ACM},
  year={1981},
  volume={28},
  pages={1-4}
}
There is given an undirected graph G -(V, E) from which edges are deleted one at a time and about which questions of the type, "Are the vertices u and v in the same connected component?" have to be answered "on-line." There is presented an algorithm which maintains a data structure in which each question is answered in constant time and for which the total time involved in answering q questions and maintaining the data structure is O(q + I VI" lED. ~ v WORDS ANt> eHRASES: algorithm… CONTINUE READING
Highly Influential
This paper has highly influenced 19 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
113 Extracted Citations
0 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 113 extracted citations

Similar Papers

Loading similar papers…