Zobrazeno 1 - 6
of 6
pro vyhledávání: '"J. Leonardo González-Ruiz"'
Autor:
Marco Antonio López-Medina, J. Leonardo González-Ruiz, J. Raymundo Marcial-Romero, J. A. Hernández
Publikováno v:
Computación y Sistemas. 26
Publikováno v:
Advances in Soft Computing ISBN: 9783030898199
MICAI (2)
MICAI (2)
In this paper, we present an algorithm to approximate the clique-width of a graph. The proposed approach is based on computing the shortest paths between pairs of vertices. We experimentally show that our proposal approximates the clique-width of sim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cfaad305905187f775b69fdf7ca64328
https://doi.org/10.1007/978-3-030-89820-5_27
https://doi.org/10.1007/978-3-030-89820-5_27
Autor:
R. Alejo, Graciela García-Rueda, José Raymundo Marcial-Romero, R. M. Valdovinos, J. Leonardo González-Ruiz, Jesús Valdés-González
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030490751
MCPR
MCPR
Earthquakes are events that cannot be predicted. However, when they occur, devastating consequences are shown in economic, social and structural areas, among others. In this paper, the mining of association rules is carried out in order to estimate t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07f38ba04bce572a31253edc15dc92c5
https://doi.org/10.1007/978-3-030-49076-8_5
https://doi.org/10.1007/978-3-030-49076-8_5
Publikováno v:
Research in Computing Science. 96:31-42
The exact real number representation can grow arbitrarily so it does not truncate or rounds up as opposed to oating point number representation. The advantage of this representation is that not rounding errors are generated and any operation can be a
Publikováno v:
Advances in Soft Computing ISBN: 9783319624273
MICAI (2)
MICAI (2)
Similar to the tree-width (twd), the clique-width (cwd) is an invariant of graphs. There is a well-known relationship between the tree-width and clique-width for any graph. The tree-width of a special class of graphs called polygonal trees is 2, so t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1148435d1f693584c4d12d81a1d2c95b
https://doi.org/10.1007/978-3-319-62428-0_36
https://doi.org/10.1007/978-3-319-62428-0_36
Publikováno v:
ResearcherID
LANMR
Scopus-Elsevier
LANMR
Scopus-Elsevier
Similar to the tree-width (twd), the clique-width (cwd) is an invariant of graphs. A well known relationship between tree-width and clique-width is that cwd(G)ź3ź2twd(G)-1. It is also known that tree-width of Cactus graphs is 2, therefore the cliqu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::545a69838af4ad7debafe0a639fda868
http://ceur-ws.org/Vol-1659/paper3.pdf
http://ceur-ws.org/Vol-1659/paper3.pdf