A classification of tournaments having an acyclic tournament as a minimum feedback arc set

Information Processing Letters

Volumn 92, Issue 3, 2004, Pages 107-111

  Isaak, Garth ^a   Narayan, Darren A ^b  

^a LEHIGH UNIVERSITY   (United States)

^b ROCHESTER INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Combinatorial problems; Digraph; Feedback are set; Integer program; Linear ordering problem; Tournament

Indexed keywords

ALGORITHMS; FEEDBACK; GRAPH THEORY; INTEGER PROGRAMMING; POLYNOMIALS; SET THEORY; THEOREM PROVING;

ACYCLIC TOURNAMENT; BLOCK RANKING; FEEDBACK ARC SET; HYBRID RANKING;

DATA PROCESSING;

EID: 4744366307     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.07.001     Document Type: Article

References (6)

1. J.L. Baldwin, W.C. Kronholm, D.A. Narayan, Tournaments with a transitive tournament as a feedback arc set, Congr. Numer. 158 (2002) 43-51.
2. J.-P. Barthélemy, O. Hudry, G. Isaak, F.S. Roberts, B. Tesman, The reversing number of a digraph, Disc. Appl. Math. 60 (1995) 39-76.
3. G. Isaak, Tournaments as feedback arc sets, Electron. I. Combin. 2 (1995), Paper R20, 19 pp.
4. G. Isaak, D.A. Narayan, Complete classification of all tournaments having a disjoint union of directed paths as a minimum feedback arc set, J. Graph Theory 45 (2004) 28-47.
5. D.A. Narayan, Tournaments with feedback path powers, J. Combin. Math. Combin. Comput. 49 (2004) 85-96.
6. D.A. Narayan, The reversing number of a digraph; A disjoint union of directed stars, Congr. Numer. 145 (2000) 153-164.