Exact computation of minimum feedback vertex sets with relational algebra

MaRDI QIDQ5480635zbMATH OpenFDO

Authors Rudolf Berghammer, Alexander Fronk

Publication date 3 August 2006

zbMATH Keywords

directed graphselementary chordless cyclesfeedback vertex setsrelational algebraRelView tool

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the minimum feedback vertex set problem: Exact and enumeration algorithms
• On enumerating all minimal solutions of feedback problems
• Feedback vertex sets and cyclically reducible graphs
• An Improved Exact Algorithm for Undirected Feedback Vertex Set
• Minimal feedback vertex sets in directed split‐stars

Cited in

(9)

• An interdisciplinary approach to coalition formation
• State space analysis of Petri nets with relation-algebraic methods
• Column-wise extendible vector expressions and the relational computation of sets of sets
• Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
• An algorithm to minimize representations of finite order relations
• scientific article; zbMATH DE number 2069436 (Why is no real title available?)
• Algorithms for finding maximum transitive subtournaments
• A relation-algebraic approach to simple games
• Applying relation algebra and RelView to solve problems on orders and lattices

Describes a project that uses

Uses Software

• RelView

This page was built for publication: Exact computation of minimum feedback vertex sets with relational algebra

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