Parameterized complexity of connected even/odd subgraph problems
DOI10.1016/J.JCSS.2013.07.002zbMATH Open1311.68075OpenAlexW2154257407WikidataQ60488404 ScholiaQ60488404MaRDI QIDQ395000FDOQ395000
Fedor V. Fomin, Petr A. Golovach
Publication date: 28 January 2014
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2012/3398/
Recommendations
- Parameterized complexity of connected even/odd subgraph problems
- Parameterized complexity of even/odd subgraph problems
- Parameterized complexity of even/odd subgraph problems
- Parameterized complexity of connected induced subgraph problems
- Parameterized complexity of finding connected induced subgraphs
- The parameterised complexity of counting even and odd induced subgraphs
- Parallel Complexity of the Connected Subgraph Problem
- On the complexity of some subgraph problems
- Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
- The parameterised complexity of counting connected subgraphs and graph motifs
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Parametrized complexity theory.
- Color-coding
- Title not available (Why is that?)
- Title not available (Why is that?)
- Eulerian graphs and related topics. Part 1, Volume 1
- Parameterized Complexity of Eulerian Deletion Problems
- Counting subgraphs via homomorphisms
- Parameterized complexity of even/odd subgraph problems
Cited In (5)
This page was built for publication: Parameterized complexity of connected even/odd subgraph problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q395000)
