Testing hypergraph coloring

Document Type

Conference Proceeding

Publication Date

1-1-2001

Abstract

In this paper we initiate the study of testing properties of hypergraphs. The goal of property testing is to distinguish between the case whether a given object has a certain property or is far away from the property. We prove that the fundamental problem of colorability of k-uniform hypergraphs can be tested in time independent of the size of the hypergraph. We present a testing algorithm that examines only (k )O(k) entries of the adjacency matrix of the input hypergraph, where is a distance parameter independent of the size of the hypergraph. Notice that this algorithm tests only a constant number of entries in the adjacency matrix provided that , k, and are constant. © 2011 Springer-Verlag Berlin Heidelberg.

Identifier

84879526804 (Scopus)

ISBN

[3540422870, 9783540422877]

Publication Title

Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics

External Full Text Location

https://doi.org/10.1007/3-540-48224-5_41

e-ISSN

16113349

ISSN

03029743

First Page

493

Last Page

505

Volume

2076 LNCS

This document is currently not available here.

Share

COinS