Pages that link to "Item:Q3499736"
From MaRDI portal
The following pages link to Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$ (Q3499736):
Displaying 15 items.
- Extremal properties of the bipartite vertex frustration of graphs (Q654182) (← links)
- Improved algorithms for feedback vertex set problems (Q955350) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211) (← links)
- On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
- A cubic kernel for feedback vertex set and loop cutset (Q968273) (← links)
- An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
- Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
- A Moderately Exponential Time Algorithm for Full Degree Spanning Tree (Q3502671) (← links)
- A Linear Kernel for Planar Feedback Vertex Set (Q3503587) (← links)
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
- Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs (Q5452161) (← links)
- (Q5743513) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Robust networked multiagent optimization: designing agents to repair their own utility functions (Q6159514) (← links)
