Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Oylum Şeker"'
Publikováno v:
Networks. 73:145-169
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6cd15a0aa317cebb5a37f711f70fb4d9
https://doi.org/10.1002/net.21850
https://doi.org/10.1002/net.21850
Digital Annealer for quadratic unconstrained binary optimization: a comparative performance analysis
Digital Annealer (DA) is a computer architecture designed for tackling combinatorial optimization problems formulated as quadratic unconstrained binary optimization (QUBO) models. In this paper, we present the results of an extensive computational st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ddbeecb37cff7a86123333224b87a64
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030340285
SEA²
SEA²
It is known that any chordal graph on n vertices can be represented as the intersection of n subtrees in a tree on n nodes [5]. This fact is recently used in [2] to generate random chordal graphs on n vertices by generating n subtrees of a tree on n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c5e751e6b5d571aadab8d62672e6868
https://doi.org/10.1007/978-3-030-34029-2_2
https://doi.org/10.1007/978-3-030-34029-2_2
It is known that any chordal graph on $n$ vertices can be represented as the intersection of $n$ subtrees in a tree on $n$ nodes. This fact is recently used in [2] to generate random chordal graphs on $n$ vertices by generating $n$ subtrees of a tree
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ee8912e160f8f5c26f6e5c79087bad6
We consider the selective graph coloring problem, which is a generalization of the classical graph coloring problem. Given a graph together with a partition of its vertex set into clusters, we want to choose exactly one vertex per cluster so that the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3be73d042a7c6e76c4e14001ffce6645
Publikováno v:
Discrete Optimization. 34:100548
In this paper, we initiate the study of defective Ramsey numbers for the class of perfect graphs. Let PG be the class of all perfect graphs and R 1 PG ( i , j ) denote the smallest n such that all perfect graphs on n vertices have either a 1-dense i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::774e6f9edf6dadaf21aea037d51609c6
https://doi.org/10.1016/j.disopt.2019.06.001
https://doi.org/10.1016/j.disopt.2019.06.001
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319575858
CIAC
CIAC
Chordal graphs form one of the most well studied graph classes. Several graph problems that are NP-hard in general become solvable in polynomial time on chordal graphs, whereas many others remain NP-hard. For a large group of problems among the latte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac99441087880bd50bdb0816a2597dcb
https://doi.org/10.1007/978-3-319-57586-5_37
https://doi.org/10.1007/978-3-319-57586-5_37