Parameterized complexity of the induced subgraph problem in directed graphs
DOI10.1016/J.IPL.2007.05.005zbMATH Open1185.05076OpenAlexW2078089071MaRDI QIDQ2380001FDOQ2380001
Authors: Venkatesh Raman, Somnath Sikdar 
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.05.005
Recommendations
computational complexityinduced subgraphdirected graphsparameterized complexitycombinatorial problemshereditary properties
Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- Title not available (Why is that?)
- Fixed-parameter tractability of graph modification problems for hereditary properties
- The node-deletion problem for hereditary properties is NP-complete
- Parametrized complexity theory.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parameterized algorithms for feedback set problems and their duals in tournaments
- Parameterized complexity of finding subgraphs with hereditary properties.
Cited In (9)
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs
- Parameterized complexity of finding connected induced subgraphs
- Parameterized complexity of Eulerian deletion problems
- Parameterized complexity of connected induced subgraph problems
- Directed acyclic subgraph problem parameterized above the Poljak-Turzík bound
- The Parameterized Complexity of k-Edge Induced Subgraphs
- Parameterized complexity of Eulerian deletion problems
- Title not available (Why is that?)
- Possible winner problems on partial tournaments: a parameterized study
This page was built for publication: Parameterized complexity of the induced subgraph problem in directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380001)
