Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Theoretical computer science, programming science and theory: 421 [VDP]"'
Autor:
Dag Haugland, Phillippe Samer
Publikováno v:
Discrete Applied Mathematics
Given an undirected graph G = ( V , E ) and a positive integer k ∈ 1 , … , | V | , we initiate the combinatorial study of stable sets of cardinality exactly k in G . Our aim is to instigate the polyhedral investigation of the convex hull of fixed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e3b7b97dd2b781d8bf1224f0d706d34
https://doi.org/10.1016/j.dam.2021.01.019
https://doi.org/10.1016/j.dam.2021.01.019
Autor:
Rustam Galimullin
Publikováno v:
Journal of Logic, Language and Information
There are several ways to quantify over public announcements. The most notable are reflected in arbitrary, group, and coalition announcement logics (APAL, GAL, and CAL correspondingly), with the latter being the least studied so far. In the present w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e10be5e8d58ea97f83ecf0dd4eaad588
https://doi.org/10.1007/s10849-020-09327-2
https://doi.org/10.1007/s10849-020-09327-2