Decycling bipartite graphs

DOI10.7155/jgaa.00567zbMath1489.05147OpenAlexW3200147258MaRDI QIDQ5084689

Alain Hertz

Publication date: 28 June 2022

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00567

Mathematics Subject Classification ID

Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Feedback vertex set in hypercubes
• Decycling bubble sort graphs
• Feedback vertex sets in star graphs
• On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
• Almost exact minimum feedback vertex set in meshes and butterflies
• Decycling hypercubes
• Future paths for integer programming and links to artificial intelligence
• Structural and enumerative properties of the Fibonacci cubes
• Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs
• Solving the feedback vertex set problem on undirected graphs
• Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
• A group-theoretic model for symmetric interconnection networks
• Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
• Generalized fibonacci cubes are mostly hamiltonian
• Decycling graphs
• A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
• Reducibility among Combinatorial Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decycling bipartite graphs