EconPapers    
Economics at your fingertips  
 

What Graph Properties Are Constant-Time Testable?

Hiro Ito ()
Additional contact information
Hiro Ito: The University of Electro-Communications

The Review of Socionetwork Strategies, 2019, vol. 13, issue 2, 101-121

Abstract: Abstract In this paper, we survey what graph properties have been found to be constant-time testable at present. How to handle big data is a very important issue in computer science. Developing efficient algorithms for problems on big data is an urgent task. For this purpose, constant-time algorithms are powerful tools, since they run by reading only a constant-sized part of each input. In other words, the running time is invariant regardless of the size of the input. The idea of constant-time algorithms appeared in the 1990s and spread quickly especially in this century. Research on graph algorithms is one of the best studied areas in theoretical computer science. When we study constant-time algorithms on graphs, we have three models that differ in the way that the graphs are represented: the dense-graph model, the bounded-degree model, and the general model. The first one is used to treat properties on dense graphs, and the other two are used to treat properties on sparse graphs. In this paper, we survey one by one what properties have been found to be constant-time testable in each of the three models.

Keywords: Constant-time algorithms; Property testing; Graphs; Regularity lemma; Hyperfinite; Universal testers; Complex networks (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations: Track citations by RSS feed

Downloads: (external link)
http://link.springer.com/10.1007/s12626-019-00054-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:trosos:v:13:y:2019:i:2:d:10.1007_s12626-019-00054-0

Ordering information: This journal article can be ordered from
https://www.springer ... ystems/journal/12626

Access Statistics for this article

The Review of Socionetwork Strategies is currently edited by Katsutoshi Yada, Yasuharu Ukai and Marshall Van Alstyne

More articles in The Review of Socionetwork Strategies from Springer
Bibliographic data for series maintained by Sonal Shukla ().

 
Page updated 2019-11-06
Handle: RePEc:spr:trosos:v:13:y:2019:i:2:d:10.1007_s12626-019-00054-0