Pages that link to "Item:Q1113681"
From MaRDI portal
The following pages link to On locating minimum feedback vertex sets (Q1113681):
Displaying 16 items.
- Feedback vertex set in hypercubes (Q294845) (← links)
- Almost exact minimum feedback vertex set in meshes and butterflies (Q1129019) (← links)
- Approximating minimum feedback sets and multicuts in directed graphs (Q1386376) (← links)
- Approximating minimum feedback vertex sets in hypergraphs (Q1583598) (← links)
- The integrity of a cubic graph (Q1827848) (← links)
- Solving the feedback vertex set problem on undirected graphs (Q1975362) (← 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)
- Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs (Q2914318) (← links)
- Feedback vertex sets and cyclically reducible graphs (Q3771642) (← links)
- Finding a minimum feedback arc set in reducible flow graphs (Q3796774) (← links)
- (Q5503334) (← links)
- Algorithms and Computation (Q5897846) (← links)
- Algorithms for finding maximum transitive subtournaments (Q5963652) (← links)