Výsledky vyhledávání - "Szabó Sándor"

Akademický článek

Estimating the fractional chromatic number of a graph

Autor: Szabó Sándor

Publikováno v: Acta Universitatis Sapientiae: Informatica, Vol 13, Iss 1, Pp 122-133 (2021)

The fractional chromatic number of a graph is defined as the optimum of a rather unwieldy linear program. (Setting up the program requires generating all independent sets of the given graph.) Using combinatorial arguments we construct a more manageab

Externí odkaz: https://doaj.org/article/a0e4c8523c2e4618af7271746ac0e35d

Zobrazit plný text záznamu

Akademický článek

Metric space method for constructing splitting partitions of graphs

Autor: Szabó Sándor

Publikováno v: Acta Universitatis Sapientiae: Informatica, Vol 11, Iss 2, Pp 131-141 (2019)

In an earlier work [6] the concept of splitting partition of a graph was introduced in connection with the maximum clique problem. A splitting partition of a graph can be used to replace the graph by two smaller graphs in the course of a clique searc

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

Zobrazit plný text záznamu

Akademický článek

Estimating clique size by coloring the nodes of auxiliary graphs

Autor: Szabó Sándor

Publikováno v: Acta Universitatis Sapientiae: Informatica, Vol 10, Iss 2, Pp 137-157 (2018)

It is a common practice to find upper bound for clique number via legal coloring of the nodes of the graph. We will point out that with a little extra work we may lower this bound. Applying this procedure to a suitably constructed auxiliary graph one

Externí odkaz: https://doaj.org/article/88a60806c77a40978e4492088ef69659

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

Vyhledávací nástroje:

Upřesnit hledání