Testing hypergraph colorability

Document Type

Conference Proceeding

Publication Date

2-15-2005

Abstract

We study the problem 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. The algorithm tests only a constant number of entries in the adjacency matrix provided that ℓ, k, and ε are constants. This result is a generalization of previous results about testing graph colorability. © 2004 Elsevier B.V. All rights reserved.

Identifier

15744399663 (Scopus)

Publication Title

Theoretical Computer Science

External Full Text Location

https://doi.org/10.1016/j.tcs.2004.09.031

ISSN

03043975

First Page

37

Last Page

52

Issue

1

Volume

331

Grant

0105701

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS