Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs

Dutta, Kunal; Subramanian, C. R.

doi:10.1137/140980181

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs

MPS-Authors

/persons/resource/persons101648

Dutta, Kunal
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45571

Subramanian, C. R.
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Dutta, K., & Subramanian, C. R. (2016). Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs. SIAM Journal on Discrete Mathematics, 30(3), 1848-1865. doi:10.1137/140980181.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002C-65BD-5

Abstract

There is no abstract available