Pages that link to "Item:Q1338778"

The following pages link to On the feedback vertex set problem in permutation graphs (Q1338778):

Displaying 20 items.

• A linear-time algorithm for the weighted feedback vertex problem on interval graphs (Q286981) (← links)
• Feedback vertex set in hypercubes (Q294845) (← links)
• On the decycling number of generalized Kautz digraphs (Q477628) (← links)
• Feedback numbers of Kautz digraphs (Q879335) (← links)
• Feedback vertex set on AT-free graphs (Q944750) (← links)
• Feedback numbers of de Bruijn digraphs (Q980262) (← links)
• Minimum feedback vertex sets in shuffle-based interconnection networks (Q1007599) (← links)
• A linear time algorithm for the minimum weighted feedback vertex set on diamonds (Q1041719) (← links)
• Almost exact minimum feedback vertex set in meshes and butterflies (Q1129019) (← links)
• Degenerate matchings and edge colorings (Q1706114) (← links)
• On the complexity of singly connected vertex deletion (Q2089067) (← 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)
• The decycling number of $P_{m} \square P_{n}^{\ast}$ (Q2920881) (← links)
• Induced Forests in Regular Graphs with Large Girth (Q3545905) (← links)
• New bounds on the decycling number of generalized de Bruijn digraphs (Q4595251) (← links)
• On the Complexity of Singly Connected Vertex Deletion (Q5041193) (← links)
• (Q5708559) (← links)
• Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)