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

Frank Hellweg, Christian Sohler. Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-Freeness. In Leah Epstein, Paolo Ferragina, editors, Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings. Volume 7501 of Lecture Notes in Computer Science, pages 599-610, Springer, 2012. [doi]

@inproceedings{HellwegS12,
  title = {Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-Freeness},
  author = {Frank Hellweg and Christian Sohler},
  year = {2012},
  doi = {10.1007/978-3-642-33090-2_52},
  url = {http://dx.doi.org/10.1007/978-3-642-33090-2_52},
  researchr = {https://researchr.org/publication/HellwegS12},
  cites = {0},
  citedby = {0},
  pages = {599-610},
  booktitle = {Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings},
  editor = {Leah Epstein and Paolo Ferragina},
  volume = {7501},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-33089-6},
}