OpenAlex
PricingAboutJobs
Log inGet started
Work

Efficient algorithms for path partitions

HTML

Year: 1990
Type: article
Source: Discrete Applied Mathematics
DOI: 10.1016/0166-218x(90)90070-s
Authors: Craig Williams, Dana Richards
Institution: University of Virginia
Language: English

Topic: Advanced Graph Theory Research
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: path partitions, edge partition, independent paths, matching, edge coloring, maximum degree, graph decomposition, parallel algorithms, linear-time algorithms

Open Access status: bronze
OpenAlex ID: W1985637996
FWCI:
Cites: 10
Cited by:
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