Matching with partially ordered contracts
スポンサーリンク
概要
- 論文の詳細を見る
- 2012-10-01
著者
-
Tamura Akihisa
Department Of Computer Science And Information Mathematics The University Of Electro-communications
-
Farooq Rashid
Centre For Advanced Mathematics And Physics National University Of Sciences And Technology
-
FAROOQ Rashid
Centre for Advanced Mathematics and Physics, National University of Sciences and Technology
-
FLEINER Tamas
Department of Computer Science and Information Technology, Budapest University of Technology and Economics
関連論文
- A Semidefinite Programming Relaxation for the Generalized Stable Set Problem(Discrete Mathematics and Its Applications)
- THE GENERALIZED STABLE SET PROBLEM FOR PERFECT BIDIRECTED GRAPHS
- EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
- A Polynomial-Time Algorithm for a Stable Matching Problem with Linear Valuations and Bounded Side Payments
- Efficiently scanning all spanning trees of an undirected graph.
- Matching with partially ordered contracts