Pages that link to "Item:Q958216"
From MaRDI portal
The following pages link to On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216):
Displaying 44 items.
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
- Enumerating minimal subset feedback vertex sets (Q472481) (← links)
- On the number of minimal dominating sets on some graph classes (Q476916) (← links)
- On feedback vertex set: new measure and new structures (Q494933) (← links)
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← links)
- Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
- On the number of connected sets in bounded degree graphs (Q1627210) (← links)
- Enumeration and maximum number of minimal connected vertex covers in graphs (Q1678095) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- Covering and packing in linear space (Q1944195) (← links)
- Maximal and maximum dissociation sets in general and triangle-free graphs (Q2141169) (← links)
- On the feedback number of 3-uniform linear extremal hypergraphs (Q2150590) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- An improved exact algorithm for undirected feedback vertex set (Q2355979) (← links)
- Faster exact algorithms for some terminal set problems (Q2361353) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- Exact algorithms for maximum induced matching (Q2407101) (← links)
- On independent sets and bicliques in graphs (Q2428684) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- Subset feedback vertex sets in chordal graphs (Q2447531) (← links)
- An improved parameterized algorithm for the independent feedback vertex set problem (Q2447761) (← links)
- Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482) (← links)
- On the Number of Minimal Separators in Graphs (Q2827806) (← links)
- An Improved Exact Algorithm for Undirected Feedback Vertex Set (Q2867116) (← links)
- Circular Convex Bipartite Graphs: Feedback Vertex Set (Q2867126) (← links)
- Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration (Q2891369) (← links)
- On the Number of Connected Sets in Bounded Degree Graphs (Q2945202) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Enumerating Minimal Tropical Connected Sets (Q2971136) (← links)
- Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
- Feedback Vertex Sets in Tournaments (Q4908824) (← links)
- Solving Target Set Selection with Bounded Thresholds Faster than 2^n (Q5009485) (← links)
- On Independent Sets and Bicliques in Graphs (Q5302053) (← links)
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms (Q5302061) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Hierarchical cycle-tree packing model for optimal \(K\)-core attack (Q6140935) (← links)
- On the maximum number of maximum dissociation sets in trees with given dissociation number (Q6204327) (← links)
