OpenAlex
PricingAboutJobs
Log inGet started
Work

Finding Euler tours in parallel

HTML PDF

Year: 1984
Type: article
Source: Journal of Computer and System Sciences
DOI: 10.1016/0022-0000(84)90003-5
Authors: Mikhail Atallah, Uzi Vishkin
Institutions: Purdue University West Lafayette, Courant Institute of Mathematical Sciences, New York University
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: Euler tours, Eulerian graphs, parallel algorithms, logarithmic time complexity, directed graphs, undirected graphs

Open Access status: bronze

Funders: National Science Foundation, U.S. Department of Energy
Award: G969889393
OpenAlex ID: W2074276908
FWCI: 4.734
Cites: 14
Cited by: 83
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