Can I read Cellular Telephone Networks and Random Maps in Hypergraphs on EtoBox?

Cellular Telephone Networks and Random Maps in Hypergraphs by Ariel Halpert; Flórián Lengyel; János Pach is a Computer Science article available to read on EtoBox.

What is Cellular Telephone Networks and Random Maps in Hypergraphs about?

Let H = (V; E) be an r-uniform hypergraph of size n such that each edge of H meets at most d others. A ÿnite map f: X → E induces a bipartite graph , where Y = E, and with edge set E f = {{x; y}: x ∈ X; y ∈ f(x)}. We study matchings in the bipartite graph induced by a random f. The study was suggested by consideration of the call sequence acceptance behavior of a load-sharing system for cellular telephone networks, invented by Matula and Yang.

Who reads Cellular Telephone Networks and Random Maps in Hypergraphs?

Author

Ariel Halpert; Flórián Lengyel; János Pach

Publisher

Elsevier Science; Elsevier ; Elsevier BV (ISSN 0166-218X)

Published

2000

Language

EN

Field

Computer Science (Physical Sciences)