Skip to main content
Conference Proceedings

Local graph exploration and fast property testing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6346 LNCS(PART 1) 410-414
DOI: 10.1007/978-3-642-15775-2_35
0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We will present some recent results about testing graph properties in sparse graphs and will discuss graph exploration techniques which allow very efficient algorithms for testing graph properties. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Czumaj, A. (2010). Local graph exploration and fast property testing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6346 LNCS, pp. 410–414). https://doi.org/10.1007/978-3-642-15775-2_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free