Minimum feedback arc set of m-free digraphs

From MaRDI portal
(Redirected from Publication:2377233)
Minimum feedback arc set of \(m\)-free digraphs



Abstract: For a simple digraph G, let be the size of the smallest subset XsubseteqE(G) such that G−X has no directed cycles, and let gamma(G) be the number of unordered pairs of nonadjacent vertices in G. A digraph G is called m-free if G has no directed cycles of length at most m. This paper proves that for any m-free digraph G, which generalized some known results.












This page was built for publication: Minimum feedback arc set of \(m\)-free digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377233)