𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Faster Parameterized Algorithms for Deletion to Split Graphs

✍ Scribed by Ghosh, Esha; Kolay, Sudeshna; Kumar, Mrinal; Misra, Pranabendu; Panolan, Fahad; Rai, Ashutosh; Ramanujan, M. S.

Book ID
121299182
Publisher
Springer
Year
2013
Tongue
English
Weight
685 KB
Volume
71
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Faster Shortest-Path Algorithms for Plan
Faster Shortest-Path Algorithms for Planar Graphs
✍ Monika R Henzinger; Philip Klein; Satish Rao; Sairam Subramanian πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 445 KB

We give a linear-time algorithm for single-source shortest paths in planar graphs with nonnegative edge-lengths. Our algorithm also yields a linear-time algorithm for maximum flow in a planar graph with the source and sink on the same face. For the case where negative edge-lengths are allowed, we gi

[Lecture Notes in Computer Science] Para
[Lecture Notes in Computer Science] Parameterized and Exact Computation Volume 5917 || Even Faster Algorithm for Set Splitting!
✍ Chen, Jianer; Fomin, Fedor V. πŸ“‚ Article πŸ“… 2009 πŸ› Springer Berlin Heidelberg 🌐 German βš– 230 KB

This Book Constitutes The Refereed Best Selected Papers Of The 4th International Workshop On Parameterized And Exact Computation, Iwpec 2009, Held In Copenhagen, Denmark, In September 2009. The 25 Revised Full Papers Presented Together With 2 Invited Talks Were Carefully Reviewed And Selected From 5