Finding induced acyclic subgraphs in random digraphs

zbMath1031.05119MaRDI QIDQ1422133

C. R. Subramanian

Publication date: 5 February 2004

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/123241

zbMATH Keywords

optimization

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Random graphs (graph-theoretic aspects) (05C80)

Related Items (4)

Unnamed Item ⋮ Induced acyclic tournaments in random digraphs: sharp concentration, thresholds and algorithms ⋮ A classification of isomorphism-invariant random digraphs ⋮ Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs

This page was built for publication: Finding induced acyclic subgraphs in random digraphs