✦ LIBER ✦

Minimum feedback arc sets of directed star polygons

✍ Scribed by Hiromu Ariyoshi; Youichi Higashiyama

Book ID: 112075027
Publisher: John Wiley and Sons
Year: 1981
Tongue: English
Weight: 599 KB
Volume: 64
Category: Article
ISSN: 8756-6621
DOI: 10.1002/ecja.4410640804

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum Feedback Arc and Vertex Sets of

Minimum Feedback Arc and Vertex Sets of a Directed Graph

✍ Lempel, A.; Cederbaum, I. 📂 Article 📅 1966 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 616 KB

Minimum feedback arc set of m-free digra

Minimum feedback arc set of m-free digraphs

✍ Liang, Hao; Xu, Jun-Ming 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 161 KB

Approximating Minimum Feedback Sets and

Approximating Minimum Feedback Sets and Multicuts in Directed Graphs

✍ G. Even; J. (Seffi) Naor; B. Schieber; M. Sudan 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 207 KB

On the Determination of Minimum Feedback

On the Determination of Minimum Feedback Arc and Vertex Sets

✍ Divieti, L.; Grasselli, A. 📂 Article 📅 1968 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 504 KB

Finding a minimum feedback arc set in re

Finding a minimum feedback arc set in reducible flow graphs

✍ Vijaya Ramachandran 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 879 KB

Complete classification of tournaments h

Complete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set

✍ Garth Isaak; Darren A. Narayan 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 199 KB

## Abstract A feedback arc set of a digraph is a set of arcs whose reversal makes the resulting digraph acyclic. Given a tournament with a disjoint union of directed paths as a feedback arc set, we present necessary and sufficient conditions for this feedback arc set to have minimum size. We will p