OpenAlex
PricingAboutJobs
Log inGet started
Work

An improved algorithm for finding maximum outerplanar subgraphs

HTML PDF

Year: 2023
Type: article
Source: Discrete Applied Mathematics
DOI: 10.1016/j.dam.2023.08.009
Authors: Gruia Călinescu, Hemanshu Kaul, Bahareh Kudarzi
Institution: Illinois Institute of Technology
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: approximation algorithms, approximation ratio, NP-complete problems, outerplanar graphs, graph partitioning

Open Access status: green
OpenAlex ID: W4387149517
FWCI: 0.436
Cites: 45
Cited by: 3
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