On Convex Subsets in Tournaments

DOI10.1137/S0895480193251234MaRDI QIDQ4875436zbMATH OpenOpenAlexFDO

Authors David J. Haglin, Marty J. Wolf

Publication date 23 March 1997

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480193251234

zbMATH Keywords

algorithmdigraphparallelizationtournamentconvex subset

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Transitive convex subsets in large tournaments
• An optimal algorithm for finding all convex subsets in tournaments
• Convex invariants in multipartite tournaments
• scientific article; zbMATH DE number 2147941
• Tournaments with near-linear transitive subsets
• On two-path convexity in multipartite tournaments
• On Sets of Consistent Arcs in a Tournament
• scientific article; zbMATH DE number 3453647
• scientific article; zbMATH DE number 7731176
• Chen and Chvátal's conjecture in tournaments

Cited in

(12)

• On Sets of Consistent Arcs in a Tournament
• Critical 3-hypergraphs
• An optimal algorithm for finding all convex subsets in tournaments
• scientific article; zbMATH DE number 3453647 (Why is no real title available?)
• Prime 3-uniform hypergraphs
• Transitive convex subsets in large tournaments
• The primality graph of critical 3-hypergraphs
• On the tournament equilibrium set
• scientific article; zbMATH DE number 2147941 (Why is no real title available?)
• A refinement of the uncovered set in tournaments
• 3-uniform hypergraphs: modular decomposition and realization by tournaments
• scientific article; zbMATH DE number 4114666 (Why is no real title available?)

This page was built for publication: On Convex Subsets in Tournaments

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