𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient and fair solution for communication graph games

✍ Scribed by René van den Brink; Anna Khmelnitskaya; Gerard van der Laan

Book ID
119232217
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
209 KB
Volume
117
Category
Article
ISSN
0165-1765

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Factorization for efficient solution of
Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products
✍ A. Kaveh; H. Rahami 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 483 KB

## Abstract Many structural models can be generated as the graph products of two or three subgraphs known as their generators. The main types of graph products consist of Cartesian, strong Cartesian, direct, and lexicographic products. In this paper, a general method is presented for the factorizat

Efficient algorithms for finding maximum
Efficient algorithms for finding maximum cliques of an overlap graph
✍ Sumio Masuda; Kazuo Nakajima; Toshinobu Kashiwabara; Toshio Fujisawa 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 728 KB

Let F = { I , , 12,. . . , Z,,} be a finite family of closed intervals on the real line. Two intervals 4 and Ik in F are said to overlap each other if they intersect but neither one of them contains the other. A graph G = (V, E) is called an overlap graph for F if there is a one-to-one correspondenc