@inproceedings{29181ec87b0443859d3915b35c1c08d4,
title = "Representing transitive relationships with parallel node sets",
abstract = "The authors describe a massively parallel representation of the closure of a transitive relationships, based on a parallelly maintained node set. The link insert operation for this representation is discussed. The main step of such an insert operation is shown, and difficulties due to so called jumping arcs are explained and attacked. Specifically, it is established that candidates for jumping arcs are contained implicitly in the parallel node set representation.",
author = "E. Lee and J. Geller",
note = "Publisher Copyright: {\textcopyright} 1993 IEEE.; 1993 IEEE Workshop on Advances in Parallel and Distributed Systems, APADS 1993 ; Conference date: 06-10-1993",
year = "1993",
doi = "10.1109/APADS.1993.588919",
language = "English (US)",
series = "Proceedings of the IEEE Workshop on Advances in Parallel and Distributed Systems, APADS 1993",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "140--145",
editor = "Bharat Bhargava",
booktitle = "Proceedings of the IEEE Workshop on Advances in Parallel and Distributed Systems, APADS 1993",
address = "United States",
}