On the cores of games arising from integer edge covering functions of graphs
Year of publication: |
2013
|
---|---|
Authors: | Park, Boram ; Kim, Suh-ryung ; Kim, Hye Kyung |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 26.2013, 4, p. 786-798
|
Subject: | Integer edge covering problems on graphs | Integer edge covering functions of graphs | Edge covering problems | Decomposition theorems | Graphentheorie | Graph theory | Core | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Kooperatives Spiel | Cooperative game | Spieltheorie | Game theory |
-
Computing the Nucleolus of Min-Cost Spanning Tree Games is Np-Hard
Faigle, Ulrich, (1998)
-
Least-cost influence maximization on social networks
Günneç, Dilek, (2020)
-
Stable set reformulations for the degree preserving spanning tree problem
Lucena, Abílio, (2024)
- More ...
-
On the possible scientific laws
Kim, Suh-Ryung, (1990)
-
Kim, Hye Kyung, (2013)
-
Fang, Qizhi, (2005)
- More ...