Czumaj, Artur (2010) Local graph exploration and fast property testing. In: 16th Annual European Symposium on Algorithms (ESA 2010), Liverpool, England, 6-8 Sep 2010. Published in: Lecture Notes in Computer Science, Vol.6346 pp. 410-414. doi:10.1007/978-3-642-15775-2_35 ISSN 0302-9743.

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Request Changes to record.

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.

Item Type:	Conference Item (Paper)
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions:	Faculty of Science, Engineering and Medicine > Science > Computer Science
Journal or Publication Title:	Lecture Notes in Computer Science
Publisher:	Springer
ISSN:	0302-9743
Official Date:	2010
Dates:	Date Event 2010 Published
Volume:	Vol.6346
Page Range:	pp. 410-414
DOI:	10.1007/978-3-642-15775-2_35
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access
Conference Paper Type:	Paper
Title of Event:	16th Annual European Symposium on Algorithms (ESA 2010)
Type of Event:	Other
Location of Event:	Liverpool, England
Date(s) of Event:	6-8 Sep 2010

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item