Solving graph theory problems using reconfigurable pipelined optical buses

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Citations (Scopus)

Abstract

We solve a number of important and interesting problems from graph theory on a linear array with a reconfigurable pipelined optical bus system. Our algorithms are hased on fast matrix multiplication and extreme value finding algorithms, and are currently the fastest algorithms. We also distinguish the two cases where weights have bounded/unbounded magnitude and precision.

Original languageEnglish
Title of host publicationParallel and Distributed Processing - 11 th IPPS/SPDP 1999 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, Proceedings
EditorsJosé Rolim
PublisherSpringer Verlag
Pages911-923
Number of pages13
ISBN (Print)3540658319, 9783540658313
DOIs
Publication statusPublished - 1999
Externally publishedYes
Event13th International Parallel Processing Symposium, IPPS 1999 Held in Conjunction with the 10th Symposium on Parallel and Distributed Processing, SPDP 1999 - San Juan, United States
Duration: 12 Apr 199916 Apr 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1586
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Parallel Processing Symposium, IPPS 1999 Held in Conjunction with the 10th Symposium on Parallel and Distributed Processing, SPDP 1999
Country/TerritoryUnited States
CitySan Juan
Period12/04/9916/04/99

Fingerprint

Dive into the research topics of 'Solving graph theory problems using reconfigurable pipelined optical buses'. Together they form a unique fingerprint.

Cite this