What Graph Properties Are Constant-Time Testable?

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 pow...

Full description

Saved in:
Bibliographic Details
Published in:The review of socionetwork strategies 2019-09, Vol.13 (2), p.101-121
Main Author: Ito, Hiro
Format: Article
Language:English
Subjects:
Algorithms
Big Data
Computer science
Data management
Graphical representations
Graphs
Properties (attributes)
Run time (computers)
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1867-3236
DOI:10.1007/s12626-019-00054-0