OpenAlex
PricingAboutJobs
Log inGet started
Work

An Efficient Parallel Algorithm for Computing Bicompatible Elimination Ordering (BCO) of Proper Interval Graphs

HTML

Year: 2002
Type: conference-paper
Source: Lecture notes in computer science
Parent work: High Performance Computing — HiPC 2002: 9th International Conference Bangalore, India, December 18–21, 2002 Proceedings
DOI: 10.1007/3-540-36265-7_32
Authors: B. S. Panda, Sajal K. Das
Institutions: Indian Institute of Technology Delhi, The University of Texas at Arlington
Language: English

Topic: Advanced Graph Theory Research
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: proper interval graphs, parallel algorithms, NC algorithms, Hamiltonian cycles, articulation points, bridges, shortest path, elimination orderings

Open Access status: closed
OpenAlex ID: W1548145905
FWCI:
Cites: 19
Cited by: 1
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