OpenAlex
PricingAboutJobs
Log inGet started
Work

Parameterized Complexity of Shortest Path with Positive Disjunctive Constraints

HTML

Year: 2025
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Combinatorial Optimization and Applications: 17th International Conference, COCOA 2024, Beijing, China, December 6–8, 2024, Proceedings, Part II
DOI: 10.1007/978-981-96-4448-3_2
Authors: Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan
Institutions: National Institute of Science Education and Research, Homi Bhabha National Institute, Indian Institute of Technology Jammu, Indraprastha Institute of Information Technology Delhi, University of Leeds
Language: English

Topic: Advanced Graph Theory Research
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: shortest path, parameterized complexity, fixed-parameter tractability, polynomial kernelization, vertex cover, structural parameterization, modulators, hereditary graph classes, edge deletion

Open Access status: closed
OpenAlex ID: W4410061314
FWCI: 0.449
Cites: 14
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
Supporters
Legal
Privacy
Accessibility
Terms
Security