The minimum feedback arc set problem and the acyclic disconnection for graphs
type: Item
instance of: scholarly article
title: The minimum feedback arc set problem and the acyclic disconnection for graphs
zbMATH Open document ID: 1361.05047
author: A. P. Figueroa
author: César Hernández-Cruz
author: M. Olsen
published in: Discrete Mathematics
publication date: 2017-05-10T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 6713452
zbMATH Keywords: feedback arc set
zbMATH Keywords: acyclic disconnection
zbMATH Keywords: oriented planar graphs
zbMATH Keywords: NP-completeness
MaRDI profile type: Publication
full work available at URL: j.disc.2017.02.012
OpenAlex ID: W2603633312
cites work: Ranking Tournaments
cites work: On the acyclic disconnection and the girth
cites work: Q4539516
cites work: The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
cites work: A fast and effective heuristic for the feedback arc set problem
cites work: On the acyclic disconnection of multipartite tournaments
cites work: Arc‐Disjoint Cycles and Feedback Arc Sets
cites work: Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs
cites work: Circulant tournaments of prime order are tight
cites work: Circular colorings of edge-weighted graphs
cites work: The dichromatic number of a digraph
cites work: The acyclic disconnection of a digraph
DOI: 10.1016/J.DISC.2017.02.012
description: scientific article; zbMATH DE number 6713452