Pages that link to "Item:Q3771642"
From MaRDI portal
The following pages link to Feedback vertex sets and cyclically reducible graphs (Q3771642):
Displaying 27 items.
- Feedback vertex set in hypercubes (Q294845) (← links)
- On the decycling number of generalized Kautz digraphs (Q477628) (← links)
- Feedback arc set in bipartite tournaments is NP-complete (Q845963) (← links)
- Feedback numbers of Kautz digraphs (Q879335) (← links)
- Feedback numbers of de Bruijn digraphs (Q980262) (← links)
- Minimum feedback vertex sets in shuffle-based interconnection networks (Q1007599) (← links)
- Feedback vertex sets in star graphs (Q1029080) (← links)
- Parallelism and the feedback vertex set problem (Q1111395) (← links)
- On locating minimum feedback vertex sets (Q1113681) (← links)
- On enumerating all minimal solutions of feedback problems (Q1348395) (← links)
- New bounds on the size of the minimum feedback vertex set in meshes and butterflies. (Q1853082) (← links)
- The decycling number of outerplanar graphs (Q1956257) (← links)
- Solving the feedback vertex set problem on undirected graphs (Q1975362) (← links)
- New formulae for the bipartite vertex frustration and decycling number of graphs (Q2008493) (← links)
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem (Q2028800) (← links)
- The size of graphs with given feedback vertex number (Q2127624) (← links)
- On the feedback number of 3-uniform linear extremal hypergraphs (Q2150590) (← links)
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles (Q2296552) (← links)
- Feedback vertex sets in mesh-based networks (Q2383604) (← links)
- New upper bounds on feedback vertex numbers in butterflies (Q2390267) (← links)
- A constraint programming approach to cutset problems (Q2489126) (← links)
- Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT (Q2632009) (← links)
- The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem (Q4009810) (← links)
- New bounds on the decycling number of generalized de Bruijn digraphs (Q4595251) (← links)
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis (Q5963653) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Maximum weighted induced forests and trees: new formulations and a computational comparative review (Q6071056) (← links)
