On Convex Subsets in Tournaments

DOI10.1137/S0895480193251234zbMath0858.05050OpenAlexW2017269855MaRDI QIDQ4875436

Marty J. Wolf, David J. Haglin

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

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

Related Items (3)

Prime 3-uniform hypergraphs ⋮ Critical 3-hypergraphs ⋮ 3-uniform hypergraphs: modular decomposition and realization by tournaments

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