Exact localisations of feedback sets

DOI10.1007/S00224-017-9777-6zbMATH Open1396.68080arXiv1702.07612OpenAlexW2592574264WikidataQ59528930 ScholiaQ59528930MaRDI QIDQ722200FDOQ722200

Authors: Michael Hecht 

Publication date: 23 July 2018

Published in: Theory of Computing Systems (Search for Journal in Brave)

Abstract: The feedback arc (vertex) set problem, shortened FASP (FVSP), is to transform a given multi digraph $G=(V,E)$ into an acyclic graph by deleting as few arcs (vertices) as possible. Due to the results of Richard M. Karp in 1972 it is one of the classic NP-complete problems. An important contribution of this paper is that the subgraphs $G_{mathrmel}(e)$, $G_{mathrmsi}(e)$ of all elementary cycles or simple cycles running through some arc $einE$, can be computed in $$ and $mathcalO(|E{|}^4)$, respectively. We use this fact and introduce the notion of the essential minor and isolated cycles, which yield a priori problem size reductions and in the special case of so called resolvable graphs an exact solution in $mathcalO(|V||E{|}^3)$. We show that weighted versions of the FASP and FVSP possess a Bellman decomposition, which yields exact solutions using a dynamic programming technique in times $$ and $$, where $mleq|E|-|V|+1$, $nleq(Delta(G)-1)|V|-|E|+1$, respectively. The parameters $m,n$ can be computed in $mathcalO(|E{|}^3)$, $mathcalO(Delta(G{)}^3|V{|}^3)$, respectively and denote the maximal dimension of the cycle space of all appearing meta graphs, decoding the intersection behavior of the cycles. Consequently, $m,n$ equal zero if all meta graphs are trees. Moreover, we deliver several heuristics and discuss how to control their variation from the optimum. Summarizing, the presented results allow us to suggest a strategy for an implementation of a fast and accurate FASP/FVSP-SOLVER.

Full work available at URL: https://arxiv.org/abs/1702.07612

Recommendations

• Tight localizations of feedback sets
• An exact method for the minimum feedback arc set problem
• A fast and effective heuristic for the feedback arc set problem
• scientific article; zbMATH DE number 219267
• Finding a minimum feedback arc set in reducible flow graphs

zbMATH Keywords

linear ordering problemsimple cycleacyclic subgraph problemelementary cyclefeedback set problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Reducibility among combinatorial problems
• Computational Complexity
• The directed subgraph homeomorphism problem
• The ellipsoid method and its consequences in combinatorial optimization
• Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament
• A fixed-parameter algorithm for the directed feedback vertex set problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Ranking Tournaments
• Title not available (Why is that?)
• On the hardness of approximating minimum vertex cover
• Title not available (Why is that?)
• The theory of graphs. Translated from the 1958 French edition by Alison Doig.
• A Minimax Theorem for Directed Graphs
• Approximating minimum feedback sets and multicuts in directed graphs
• On the approximability of the maximum common subgraph problem
• Finding a minimum feedback arc set in reducible flow graphs
• Estimating the Number of s-t Paths in a Graph
• On the acyclic subgraph polytope
• Retiming synchronous circuitry
• Enumeration of the Elementary Circuits of a Directed Graph
• Title not available (Why is that?)
• Finding All the Elementary Circuits of a Directed Graph
• Title not available (Why is that?)
• On Algorithms for Enumerating All Circuits of a Graph
• Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs
• A fast and effective algorithm for the feedback arc set problem

Cited In (12)

• Tight localizations of feedback sets
• A spin glass approach to the directed feedback vertex set problem
• Combinatorial algorithms for feedback problems in directed graphs
• Feedback arc set. A history of the problem and algorithms
• On the complexity of feedback set problems in signed digraphs
• Spin Glass approach to the feedback vertex set problem
• Minimum feedback arc sets in rotator and incomplete rotator graphs
• An exact method for the minimum feedback arc set problem
• Efficient heuristics to compute minimal and stable feedback arc sets
• DTCPP - A heuristic program for testing decyclization in directed graphs and its isomorphic image by using combinatorial approach
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Exact localisations of feedback sets

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