Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-Freeness

DOI10.1007/978-3-642-33090-2_52zbMath1365.68461arXiv1312.0497OpenAlexW67256834MaRDI QIDQ2912878

Frank Hellweg, Christian Sohler

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

This page was built for publication: Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-Freeness