Anna Zoura

Learn More
In this paper we describe robust and eecient implementations of two graph connectivity algorithms. The implementations are based on the LEDA library of eecient data types and algorithms 18]. Moreover, we provide experimental evaluations of the implemented algorithms and we compare their performance to other graph connectivity algorithms currently(More)
The research and development of computer-based, networked learning environments will be built around electronic communication and collaboration services that will play a significant role in the improvement of the learning procedure. Applications of this kind provide tutors and trainees with the ability of continual, close and efficient cooperation, en masse(More)
  • 1