OpenAlex
PricingAboutJobs
Log inGet started
Work

A simple linear-time algorithm to recognize interval graphs

HTML

Year: 1987
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Graph-Theoretic Concepts in Computer Science: 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers
DOI: 10.1007/3-540-17218-1_45
Authors: Norbert Korte, Rolf H. Möhring
Language: English

Topic: Advanced Graph Theory Research
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: interval graphs, graph recognition, linear-time algorithms, maximal cliques, tree representation, amortized time

Open Access status: closed
OpenAlex ID: W1575271632
FWCI: 1.252
Cites: 7
Cited by: 12
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
Supporters
Legal
Privacy
Accessibility
Terms
Security