Reconstruction of complete interval tournaments. II

zbMath1198.05113arXiv1012.4210MaRDI QIDQ3589556

Antal Iványi

Publication date: 20 September 2010

Full work available at URL: https://arxiv.org/abs/1012.4210

zbMATH Keywords

tournamentsscore sequencesefficiency of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Directed graphs (digraphs), tournaments (05C20) Randomized algorithms (68W20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Tournaments associated with multigraphs and a theorem of Hakimi ⋮ Recognition of split-graphic sequences ⋮ On partial sorting in restricted rounds ⋮ On scores, losing scores and total scores in hypertournaments

This page was built for publication: Reconstruction of complete interval tournaments. II