Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A linear systolic algorithm for the connected component problem

From MaRDI portal
Publication:1123585
Jump to:navigation, search

DOI10.1007/BF01952677zbMath0677.68001MaRDI QIDQ1123585

Ming-Shin Tsai, Shing-Tsaan Huang

Publication date: 1989

Published in: BIT (Search for Journal in Brave)


zbMATH Keywords

graphsystolic algorithmconnected component problem


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Connectivity (05C40) Theory of software (68N99)




Cites Work

  • Unnamed Item
  • A Systolic Design for Connectivity Problems
  • VLSI Algorithms for the Connected Component Problem
  • New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
  • Computing connected components on parallel computers
  • Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
  • An O(logn) parallel connectivity algorithm
  • Efficiency of a Good But Not Linear Set Union Algorithm


This page was built for publication: A linear systolic algorithm for the connected component problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1123585&oldid=13178055"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 04:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki