Decycling with a matching
From MaRDI portal
Publication:2628271
DOI10.1016/j.ipl.2017.04.003zbMath1416.05229MaRDI QIDQ2628271
Uéverton S. Souza, Dieter Rautenbach, Carlos Vinícius G. C. Lima, Jayme Luiz Szwarcfiter
Publication date: 13 June 2017
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2017.04.003
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Perfect matching cuts partitioning a graph into complementary subgraphs, Feedback arc number and feedback vertex number of Cartesian product of directed cycles, On the computational complexity of the bipartizing matching problem
Cites Work