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

Faster Parameterized Algorithms for Deletion to Split Graphs · SciRah

article

Faster Parameterized Algorithms for Deletion to Split Graphs

Esha Ghosh^{a b}, Sudeshna Kolay^{a b}, Mrinal Kumar^{c d}, Pranabendu Misra^{e f}, Fahad Panolan^{a b}, Ashutosh Rai^{a b}✉, M. S. Ramanujan^{a b}

^aThe Institute of Mathematical Sciences, Chennai, India
^bThe Institute of Mathematical Sciences,Chennai,India
^cIndian Institute of Technology, Madras, Chennai, India
^dIndian Institute of Technology Madras, Chennai India
^eChennai Mathematical Institute, Chennai, India
^fChennai Mathematical Institute , Chennai , India
✉Corresponding author

Algorithmica Springer Science+Business Media2013-10-04 42 citations28 references

Looking for the full paper…

Share

Faster Parameterized Algorithms for Deletion to Split 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

Algorithmica →

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/s00453-013-9837-5
OpenAlex: W2048845385

Metadata from OpenAlex, Crossref.