The following pages link to (Q3145802):
Displaying 50 items.
- Augmenting approach for some maximum set problems (Q284765) (← links)
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
- On the decycling number of generalized Kautz digraphs (Q477628) (← links)
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← links)
- On parameterized independent feedback vertex set (Q690464) (← links)
- FPT algorithms for connected feedback vertex set (Q695322) (← links)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- Feedback numbers of Kautz digraphs (Q879335) (← links)
- Improved algorithms for feedback vertex set problems (Q955350) (← 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)
- Soft arc consistency revisited (Q969527) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Feedback numbers of de Bruijn digraphs (Q980262) (← links)
- Minimum feedback vertex sets in shuffle-based interconnection networks (Q1007599) (← links)
- Edge-disjoint odd cycles in planar graphs. (Q1425111) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- Cycle reversions and dichromatic number in tournaments (Q1715622) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- Minimum feedback vertex set and acyclic coloring. (Q1853123) (← links)
- Analysis, calculation and utilization of the \(k\)-balance attribute in interdependent networks (Q1990190) (← links)
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem (Q2028800) (← links)
- Modeling the pancreatic cancer microenvironment in search of control targets (Q2051435) (← links)
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs (Q2131857) (← links)
- Well-partitioned chordal graphs (Q2144581) (← links)
- On the feedback number of 3-uniform linear extremal hypergraphs (Q2150590) (← links)
- Almost always observable hybrid systems (Q2178194) (← links)
- Target set selection on generalized pancake graphs (Q2195642) (← links)
- Half-integral packing of odd cycles through prescribed vertices (Q2259381) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- Mim-width. II. The feedback vertex set problem (Q2285053) (← links)
- Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
- An improved exact algorithm for undirected feedback vertex set (Q2355979) (← links)
- New upper bounds on feedback vertex numbers in butterflies (Q2390267) (← links)
- The \(k\)-strong induced arboricity of a graph (Q2408964) (← links)
- A constraint programming approach to cutset problems (Q2489126) (← links)
- Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT (Q2632009) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Feedback vertex set on Hamiltonian graphs (Q2672436) (← links)
- Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs (Q2813347) (← links)
- An Improved Exact Algorithm for Undirected Feedback Vertex Set (Q2867116) (← links)
- Circular Convex Bipartite Graphs: Feedback Vertex Set (Q2867126) (← links)
- Deterministic Algorithms for the Independent Feedback Vertex Set Problem (Q2946071) (← links)
- Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
- Multistage methods for freight train classification (Q3076019) (← links)
- A spin glass approach to the directed feedback vertex set problem (Q3302766) (← links)
- Generalized<i>k</i>-core pruning process on directed networks (Q3303095) (← links)
- (Q3303471) (← links)
