Amanote Research

Amanote Research

    RegisterSign In

An Efficient and Fair Solution for Communication Graph Games

SSRN Electronic Journal
doi 10.2139/ssrn.1785246
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2011

Authors
René van den BrinkAnna B. KhmelnitskayaGerard van der Laan
Publisher

Elsevier BV


Related search

Average Tree Solution and Subcore for Acyclic Graph Games

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
2008English

Spectral Efficient and Fair User Pairing for Full-Duplex Communication in Cellular Networks

IEEE Transactions on Wireless Communications
Electronic EngineeringApplied MathematicsComputer Science ApplicationsElectrical
2016English

An Efficient Graph Indexing Method

2012English

An Efficient Graph-Coloring Algorithm for Processor Allocation

International Journal of Information Technology and Computer Science
2013English

An Efficient Graph-Based Algorithm for Fingerprint Representation and Matching

2013English

Efficient and Fair Heart Allocation Policies for Transplantation

MDM Policy and Practice
Health PolicyPublic HealthOccupational HealthEnvironmental
2017English

A Common Algorithm for Graph-Interpretable Games

Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics
1977English

An Efficient Communication Architecture for Commodity Supercomputers

1999English

An Efficient, Cost-Effective and Simple Solution

British Dental Journal
Dentistry
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy