OpenAlex
PricingAboutJobs
Log inGet started
Work

Efficient parallel algorithms for chordal graphs

HTML

Year: 1988
Type: conference-paper
Source: Annual Symposium on Foundations of Computer Science
DOI: 10.1109/sfcs.1988.21933
Author: P.N. Klein
Institution: Harvard University
Language: English

Topic: Advanced Graph Theory Research
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: chordal graphs, parallel algorithms, perfect elimination orderings, maximum clique problem, maximum independent set, graph coloring, interval graphs, graph isomorphism testing, breadth-first search, depth-first search, graph recognition

Open Access status: closed
OpenAlex ID: W2124526408
FWCI: 5.755
Cites: 35
Cited by: 69
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