Publication Details
Title: A Minimax Arc Theorem for Reducible Flow Graphs
Author: V. Ramachandran
Group: ICSI Technical Reports
Date: November 1987
PDF: http://www.icsi.berkeley.edu/pubs/techreports/tr-87-001.pdf
Overview:
We establish a conjecture of Frank and Gyarfas by proving that the cardinality of a minimum feedback arc set in a reducible flow graph is equal to the cardinality of a maximum collection of arc disjoint cycles.
Bibliographic Information:
ICSI Technical Report TR-87-001
Bibliographic Reference:
V. Ramachandran. A Minimax Arc Theorem for Reducible Flow Graphs. ICSI Technical Report TR-87-001, November 1987
Author: V. Ramachandran
Group: ICSI Technical Reports
Date: November 1987
PDF: http://www.icsi.berkeley.edu/pubs/techreports/tr-87-001.pdf
Overview:
We establish a conjecture of Frank and Gyarfas by proving that the cardinality of a minimum feedback arc set in a reducible flow graph is equal to the cardinality of a maximum collection of arc disjoint cycles.
Bibliographic Information:
ICSI Technical Report TR-87-001
Bibliographic Reference:
V. Ramachandran. A Minimax Arc Theorem for Reducible Flow Graphs. ICSI Technical Report TR-87-001, November 1987