Skip to content

Home Search Authors Pakistan News Saved

SciRah

SciRah does not host or store research papers. Results come live from free, official scholarly APIs, and every paper links back to its original source.

Data sources

OpenAlex
Semantic Scholar
Crossref
CORE
arXiv
PubMed

Privacy policy Terms of service

Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs · SciRah

conference paper

Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs

Petr A. Golovach^a, Fahad Panolan^b, Ashutosh Rai^c✉, Saket Saurabh^{a d}

^aUniversity of Bergen, Bergen, Norway
^bIndian Institute of Technology Hyderabad, Hyderabad, India
^cDepartment of Mathematics, IIT Delhi, New Delhi, India
^dThe Institute of Mathematical Sciences, Chennai, India
✉Corresponding author

Lecture notes in computer science Springer Science+Business Media2022-01-01 0 citations13 references

Looking for the full paper…

Share

Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs

Export

PDF Details, abstract & AI summary Word (.docx) Editable document One-slide summary Image or PDF for presentations

Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.

Abstract

No abstract is available from our sources. Use “Read paper” to view it.

Plain-language summary

Discussion

Published in

Lecture notes in computer science →

Springer Science+Business Media — publisher profile →

Topics

Advanced Graph Theory Research Complexity and Algorithms in Graphs Limits and Structures in Graph Theory

Identifiers

DOI: 10.1007/978-3-031-09574-0_10
OpenAlex: W4285124465

Metadata from OpenAlex, Crossref.