OpenAlex
PricingAboutJobs
Log inGet started
Work

A parallel vertex insertion algorithm for minimum spanning trees

HTML

Year: 1986
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Automata, Languages and Programming: 13th International Colloquium Rennes, France, July 15–19, 1986 Proceedings
DOI: 10.1007/3-540-16761-7_92
Authors: Peter Varman, Kshitij Doshi
Institution: Rice University
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: minimum spanning tree, vertex insertion, parallel algorithms, parallel random access machine, divide-and-conquer, graph updates, time complexity

Open Access status: closed
OpenAlex ID: W135887360
FWCI: 0.304
Cites: 10
Cited by: 8
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