An optimal algorithm for finding all convex subsets in tournaments

MaRDI QIDQ2760997zbMATH OpenFDO

Authors Marty J. Wolf, David J. Haglin

Publication date 17 December 2001

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

convex settransitive closuretournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On Convex Subsets in Tournaments
• scientific article; zbMATH DE number 4114666
• Transitive convex subsets in large tournaments
• Algorithms for finding maximum transitive subtournaments
• An optimal algorithm for finding compact sets

Cited in

(5)

• On Convex Subsets in Tournaments
• Optimal parallel construction of prescribed tournaments
• Transitive convex subsets in large tournaments
• scientific article; zbMATH DE number 2147941 (Why is no real title available?)
• scientific article; zbMATH DE number 4114666 (Why is no real title available?)

This page was built for publication: An optimal algorithm for finding all convex subsets in tournaments

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