Faster exact algorithms for some terminal set problems

DOI10.1007/978-3-319-03898-8_14zbMATH Open1407.68212DBLPconf/iwpec/ChitnisFLMRS13OpenAlexW2201885232WikidataQ60488418 ScholiaQ60488418MaRDI QIDQ2867080FDOQ2867080

Authors: Rajesh Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh 

Publication date: 10 December 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03898-8_14

Recommendations

• Faster exact algorithms for some terminal set problems
• Subset feedback vertex set on graphs of bounded independent set size
• Enumerating minimal subset feedback vertex sets
• Subset feedback vertex set on graphs of bounded independent set size

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Cited In (7)

• Title not available (Why is that?)
• Irredundant Set Faster Than O(2 n )
• Subset feedback vertex set on graphs of bounded independent set size
• Subset feedback vertex set on graphs of bounded independent set size
• Faster exact algorithms for some terminal set problems
• Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS
• Faster exact algorithms for hard problems: A parameterized point of view

This page was built for publication: Faster exact algorithms for some terminal set problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867080)