Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Jabrayilov, Adalat"'
In this paper, we suggest new SAT encodings of the partial-ordering based ILP model for the graph coloring problem (GCP) and the bandwidth coloring problem (BCP). The GCP asks for the minimum number of colors that can be assigned to the vertices of a
Externí odkaz:
http://arxiv.org/abs/2403.15961
Autor:
Jabrayilov, Adalat, Mutzel, Petra
The vertex coloring problem asks for the minimum number of colors that can be assigned to the vertices of a given graph such that each two adjacent vertices get different colors. For this NP-hard problem, a variety of integer linear programming (ILP)
Externí odkaz:
http://arxiv.org/abs/2206.13678
Autor:
Jabrayilov, Adalat
The hop-constrained Steiner tree problem (HSTP) is a generalization of the classical Steiner tree problem. It asks for a minimum cost subtree that spans some specified nodes of a given graph, such that the number of edges between each node of the tre
Externí odkaz:
http://arxiv.org/abs/2007.07405
Autor:
Jabrayilov, Adalat, Mutzel, Petra
The Steiner tree problem with revenues, budgets and hop constraints (STPRBH) is a variant of the classical Steiner tree problem. This problem asks for a subtree in a given graph with maximum revenues corresponding to its nodes, where its total edge c
Externí odkaz:
http://arxiv.org/abs/1806.10697
Autor:
Jabrayilov, Adalat, Mutzel, Petra
The vertex coloring problem asks for the minimum number of colors that can be assigned to the vertices of a given graph such that for all vertices v the color of v is different from the color of any of its neighbors. The problem is NP-hard. Here, we
Externí odkaz:
http://arxiv.org/abs/1706.10191
Publikováno v:
In Computers & Graphics November 2021 100:66-80
We consider the problem of layering general directed graphs under height and possibly also width constraints. Given a directed graph G = (V,A) and a maximal height, we propose a layering approach that minimizes a weighted sum of the number of reverse
Externí odkaz:
http://arxiv.org/abs/1609.01755
Autor:
Benet, Lorenzo, Bui, Nguyen Binh, Erguig, Mohammed, Jabrayilov, Adalat, Maybaum, Nils, Ndula, Peter, Schlotmann, Torsten, Stahl, Sarah, Teufel, Marcus, Zheng, Hui
Dieser Endbericht befasst sich mit der Arbeit der Projektgruppe 536 zum Thema der optimierten Inferenzkontrolle in relationalen Datenbanken im Sommersemester 2009 und im Wintersemester 2009/2010. Die PG baut auf einem Prototypen für die kontrolliert
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e39558f57968738769abd3d45061535e