Faster exact algorithms for some terminal set problems

DOI10.1007/978-3-319-03898-8_14MaRDI QIDQ2867080zbMATH OpenOpenAlexDBLPWikidataFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(7)

• Subset feedback vertex set on graphs of bounded independent set size
• Faster exact algorithms for some terminal set problems
• Irredundant Set Faster Than O(2 n )
• scientific article; zbMATH DE number 1405801 (Why is no real title available?)
• Subset feedback vertex set on graphs of bounded independent set size
• 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)