Výsledky vyhledávání - "Zaválnij Bogdán"

Report

A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms

Autor: Marino, Raffaele, Buffoni, Lorenzo, Zavalnij, Bogdan

This manuscript provides a comprehensive review of the Maximum Clique Problem, a computational problem that involves finding subsets of vertices in a graph that are all pairwise adjacent to each other. The manuscript covers in a simple way classical

Externí odkaz: http://arxiv.org/abs/2403.09742

Zobrazit plný text záznamu

Akademický článek

Edge coloring of graphs, uses, limitation, complexity

Autor: Szabó Sándor, Zaválnij Bogdán

Publikováno v: Acta Universitatis Sapientiae: Informatica, Vol 8, Iss 1, Pp 63-81 (2016)

The known fact that coloring of the nodes of a graph improves the performance of practical clique search algorithm is the main motivation of this paper. We will describe a number of ways in which an edge coloring scheme proposed in [8] can be used in

Externí odkaz: https://doaj.org/article/5a864c804c98499aaa24ac4c17ac8f59

Zobrazit plný text záznamu

Akademický článek

Coloring the nodes of a directed graph

Autor: Szabó Sándor, Zaválnij Bogdán

Publikováno v: Acta Universitatis Sapientiae: Informatica, Vol 6, Iss 1, Pp 117-131 (2014)

It is an empirical fact that coloring the nodes of a graph can be used to speed up clique search algorithms. In directed graphs transitive subtournaments can play the role of cliques. In order to speed up algorithms to locate large transitive tournam

Externí odkaz: https://doaj.org/article/4b7b5f46cc85416a834e267ae952182a

Zobrazit plný text záznamu

Akademický článek

Enhanced molecular docking: Novel algorithm for identifying highest weight k-cliques in weighted general and protein-ligand graphs

Autor: Rozman, Kati, Ghysels, An, Zavalnij, Bogdan, Kunej, Tanja, Bren, Urban, Janežič, Dušanka, Konc, Janez

Publikováno v: In Journal of Molecular Structure 15 May 2024 1304

Zobrazit plný text záznamu

Report

Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations

Autor: Gellner, Alexander, Lamm, Sebastian, Schulz, Christian, Strash, Darren, Zaválnij, Bogdán

Given a vertex-weighted graph, the maximum weight independent set problem asks for a pair-wise non-adjacent set of vertices such that the sum of their weights is maximum. The branch-and-reduce paradigm is the de facto standard approach to solve the p

Externí odkaz: http://arxiv.org/abs/2008.05180

Zobrazit plný text záznamu