Zobrazeno 1 - 10
of 95
pro vyhledávání: '"toroidal grid graphs"'
Publikováno v:
In Discrete Applied Mathematics 31 December 2016 215:31-40
Publikováno v:
CTW2020-18thj Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Online, 14-16/09/2020
info:cnr-pdr/source/autori:Claudio Gentile, Giovanni Rinaldi, Esteban Salgado, Bao Duy Tran/congresso_nome:CTW2020-18thj Cologne-Twente Workshop on Graphs and Combinatorial Optimization/congresso_luogo:Online/congresso_data:14-16%2F09%2F2020/anno:2020/pagina_da:/pagina_a:/intervallo_pagine
info:cnr-pdr/source/autori:Claudio Gentile, Giovanni Rinaldi, Esteban Salgado, Bao Duy Tran/congresso_nome:CTW2020-18thj Cologne-Twente Workshop on Graphs and Combinatorial Optimization/congresso_luogo:Online/congresso_data:14-16%2F09%2F2020/anno:2020/pagina_da:/pagina_a:/intervallo_pagine
The paper reports on some preliminary results obtained by using polynomial time algorithms to solve max-cut on some special graphs within a heuristic scheme known as subgraph sampling. Computational results are reported on toroidal graphs of about 10
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=cnr_________::cb87bcfe7f498e9387043a4d42873a2c
http://www.cnr.it/prodotto/i/435156
http://www.cnr.it/prodotto/i/435156
Autor:
Shaheen, RamyS.1 (AUTHOR) shaheenramy@yahoo.com
Publikováno v:
International Journal of Computer Mathematics. Apr2009, Vol. 86 Issue 4, p584-588. 5p. 1 Diagram.
Publikováno v:
Discrete Applied Mathematics. 215:31-40
We consider a competitive diffusion process for two players on two-dimensional toroidal grid graphs. Pure Nash equilibria for the game are completely characterized; i.e., for arbitrary-sized toroidal grid graphs, we list all the initial positions tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11d882a8ecf5313bb56db75934276450
https://doi.org/10.1016/j.dam.2016.07.021
https://doi.org/10.1016/j.dam.2016.07.021
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Miguel F. Anjos
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 48:1-14
This paper is concerned with the application of semidefinite programming to the satisfiability problem, and in particular with using semidefinite liftings to efficiently obtain proofs of unsatisfiability. We focus on the Tseitin satisfiability instan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd3262a34c3290bea66fbf096d709e40
https://doi.org/10.1007/s10472-006-9041-2
https://doi.org/10.1007/s10472-006-9041-2
Autor:
Ramy Shaheen
Publikováno v:
International Journal of Computer Mathematics. 86:584-588
A k-dominating set for a graph G(V, E) is a set of vertices D⊆ V such that every vertex v∈V\ D is adjacent to at least k vertices in D. The k-domination number of G, denoted by γk(G), is the cardinality of a smallest k-dominating set of G. Here
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ce8990361aa886074ec1417ff25b03f
https://doi.org/10.1080/00207160701690284
https://doi.org/10.1080/00207160701690284
Autor:
Millichap, Christian1 (AUTHOR) Christian.Millichap@furman.edu, Salinas, Fabian2 (AUTHOR)
Publikováno v:
Graphs & Combinatorics. Jun2022, Vol. 38 Issue 3, p1-16. 16p.
Autor:
Riskin, Adrian1 ariskin@mbc.edu
Publikováno v:
Graphs & Combinatorics. Mar2005, Vol. 21 Issue 1, p131-135. 5p.