Searching for "On the Complexity of Testing Membership in the Core of min-Cost Spanning Tree Games" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

On The Complexity Of Testing Membership In The Core Of Min-Cost Spanning Tree Games
by U. Faigle, S. Fekete, W. Hochstattler, Walter Kern, Sandor P. Fekete, Winfried Hochstättler, Ulrich Faigle, Ulrich Faigle, Walter Kern, Walter Kern, Or P. Fekete Winfried Hochstattler — 1994 — International Journal of Game Theory
…@ZPR...) ON THE COMPLEXITY OF TESTING MEMBERSHIP IN THE CORE OF MIN--COST SPANNING TREE GAMES Ulrich Faigle Walter Kern…
Cited by 20 (7 self) – Add To MetaCart

Algorithms and Complexity in Combinatorial Optimization Games
by Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi — 1997 — in Annual ACM-SIAM Symposium on Discrete Algorithms
… the complexity of testing membership in the core of min-cost spanning tree games [14]. In general, these studies…
Cited by 8 (0 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB