skip to content
A lower bound on the complexity of regional matchings on the hypercube Preview this item
ClosePreview this item
Checking...

A lower bound on the complexity of regional matchings on the hypercube

Author: Gil Kalai; Larry Stockmeyer
Publisher: Yorktown Heights, N.Y. : IBM Research Division, [1991]
Series: International Business Machines Corporation.; Research Division.; Research report
Edition/Format:   Book : English
Database:WorldCat
Summary:
Abstract: "As defined by Awerbuch and Peleg, an m-regional matching for a graph G = (V, E) is a family of sets R(u), W(u) [subset of] V for u [member of] V, such that if the distance between vertices v and w is at most m then R(v) intersects W(w). We define a probabilistic generalization of a regional matching, and prove a lower bound on the complexity of any m-regional matching for the hypercube graph, where the  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Gil Kalai; Larry Stockmeyer
OCLC Number: 32046550
Notes: "November 1, 1991."
Description: 13 p. ; 28 cm.
Series Title: International Business Machines Corporation.; Research Division.; Research report
Responsibility: Gil Kalai, Larry Stockmeyer.

Abstract:

Abstract: "As defined by Awerbuch and Peleg, an m-regional matching for a graph G = (V, E) is a family of sets R(u), W(u) [subset of] V for u [member of] V, such that if the distance between vertices v and w is at most m then R(v) intersects W(w). We define a probabilistic generalization of a regional matching, and prove a lower bound on the complexity of any m-regional matching for the hypercube graph, where the complexity is measured in terms of the maximum size and radius of the sets R(u) and W(u). We use this lower bound to give a lower bound on the communication complexity of any probabilistic algorithm for the problem of on-line tracking of a mobile user on the hypercube. In the course of proving the lower bound on the complexity of regional matchings, we consider a generalization of the vertex isoperimetric problem on the cube."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/32046550>
library:oclcnum"32046550"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/32046550>
rdf:typeschema:Book
schema:about
schema:about
schema:contributor
schema:creator
schema:datePublished"1991"
schema:description"Abstract: "As defined by Awerbuch and Peleg, an m-regional matching for a graph G = (V, E) is a family of sets R(u), W(u) [subset of] V for u [member of] V, such that if the distance between vertices v and w is at most m then R(v) intersects W(w). We define a probabilistic generalization of a regional matching, and prove a lower bound on the complexity of any m-regional matching for the hypercube graph, where the complexity is measured in terms of the maximum size and radius of the sets R(u) and W(u). We use this lower bound to give a lower bound on the communication complexity of any probabilistic algorithm for the problem of on-line tracking of a mobile user on the hypercube. In the course of proving the lower bound on the complexity of regional matchings, we consider a generalization of the vertex isoperimetric problem on the cube.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/46055289>
schema:inLanguage"en"
schema:name"A lower bound on the complexity of regional matchings on the hypercube"@en
schema:numberOfPages"13"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.