Yazar "0000-0002-2688-5703" için Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering listeleme
-
Hierarchical b-Matching
Emek, Yuval; Kutten, Shay; Shalom, Mordechai; Zaks, Shmuel (Springer Science and Business Media Deutschland GmbH, 2021)A matching of a graph is a subset of edges no two of which share a common vertex, and a maximum matching is a matching of maximum cardinality. In a b-matching every vertex v has an associated bound bv, and a maximum ... -
On the maximum cardinality cut problem in proper interval graphs and related graph classes
Boyacı, Arman; Ekim, Tınaz; Shalom, Mordechai (Elsevier B.V., 2022-01-04)Although it has been claimed in two different papers that the maximum cardinality cut problem is polynomial-time solvable for proper interval graphs, both of them turned out to be erroneous. In this work we consider the ... -
On the online coalition structure generation problem
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel (AI Access Foundationusc Information Sciences Inst, 2021)We consider the online version of the coalition structure generation problem, in which agents, corresponding to the vertices of a graph, appear in an online fashion and have to be partitioned into coalitions by an authority ...