Enumerating minimum feedback vertex sets in directed graphs with union-cat trees

DOI10.1051/ITA/2024015MaRDI QIDQ6930997zbMATH OpenFDO

Authors Moussa Abdenbi, Alexandre Blondin Massé, Alain Goupil, Mélodie Lapointe, Martin Lavoie

Publication date 11 September 2025

Published in RAIRO. Theoretical Informatics and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/ITA/2024015

zbMATH Keywords

directed graphsfeedback vertex setunion-cat tree

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30)

Cites work

• A contraction algorithm for finding small cycle cutsets
• A greedy randomized adaptive search procedure for the feedback vertex set problem
• A linear-time algorithm for the weighted feedback vertex problem on interval graphs
• Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
• Enumerating minimal subset feedback vertex sets
• Experimental and Efficient Algorithms
• Feedback vertex sets and cyclically reducible graphs
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 1175490 (Why is no real title available?)
• On the feedback vertex set problem in permutation graphs
• On the minimum feedback vertex set problem: Exact and enumeration algorithms
• Reducibility among combinatorial problems

This page was built for publication: Enumerating minimum feedback vertex sets in directed graphs with union-cat trees

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