Serial-parallel tradeoff analysis of all-pairs shortest path algorithms in reconfigurable computing

Mak, Sui-Tung; Lam, K.P.

doi:10.1109/fpt.2002.1188697

2002 IEEE International Conference on Field-Programmable Technology, 2002. (FPT). Proceedings.

DOI: 10.1109/fpt.2002.1188697

|View full text |Cite

Serial-parallel tradeoff analysis of all-pairs shortest path algorithms in reconfigurable computing

Sui-Tung Mak

K.P. Lam²

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Serial-parallel tradeoff analysis of all-pairs shortest path algorithms in reconfigurable computing

Cited by 1 publication

References 2 publications

High-Speed Shortest Path Co-processor Design

High-Speed Shortest Path Co-processor Design

Contact Info

Product

Resources

About