Articolul precedent |
Articolul urmator |
248 0 |
SM ISO690:2012 GRIGORIU, Nicolae. Kernels in Transitively Orientable Graphs. In: Conference on Applied and Industrial Mathematics: CAIM 2018, 20-22 septembrie 2018, Iași, România. Chișinău, Republica Moldova: Casa Editorial-Poligrafică „Bons Offices”, 2018, Ediţia a 26-a, pp. 73-74. ISBN 978-9975-76-247-2. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Conference on Applied and Industrial Mathematics Ediţia a 26-a, 2018 |
|||||
Conferința "Conference on Applied and Industrial Mathematics" Iași, România, Romania, 20-22 septembrie 2018 | |||||
|
|||||
Pag. 73-74 | |||||
|
|||||
Descarcă PDF | |||||
Rezumat | |||||
Kernel represents an abstract generalization of a concept of solution for cooperative games. These structures have many applications in game theory.[1] We will recall that kernel is a subset of vertices K of the directed graph !G = (X;U) when K does not contain adjacent vertices and every vertex in X n K has a successor in K.[2] |
|||||
|