OpenAlex
PricingAboutJobs
Log inGet started
Work

Graph problems on a mesh-connected processor array (Preliminary Version)

HTML

Year: 1982
Type: conference-paper
Source: ACM Symposium on Theory of Computing (STOC)
Parent work: Proceedings of the fourteenth annual ACM symposium on Theory of computing
DOI: 10.1145/800070.802210
Authors: Mikhail J. Atallah, S. Rao Kosaraju
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: graph algorithms, mesh-connected processor arrays, parallel algorithms, articulation points, shortest cycle, minimum spanning tree, undirected graphs

Open Access status: closed
OpenAlex ID: W1990107886
FWCI: 1.048
Cites: 19
Cited by: 14
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security