Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration
From MaRDI portal
Publication:3557055
DOI10.1007/978-3-642-12200-2_54zbMath1283.05248MaRDI QIDQ3557055
C. R. Subramanian, Kunal Dutta
Publication date: 27 April 2010
Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12200-2_54
random graphs; analysis of algorithms; feedback vertex set; acyclic tournaments; 2-point concentration
68W40: Analysis of algorithms
05C80: Random graphs (graph-theoretic aspects)
05C85: Graph algorithms (graph-theoretic aspects)
05C20: Directed graphs (digraphs), tournaments
Related Items