Zobrazeno 1 - 10
of 658
pro vyhledávání: '"Grafs, Teoria de"'
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Linear Multilinear Algebra
Universitat Politècnica de Catalunya (UPC)
Linear Multilinear Algebra
The universal adjacency matrix U of a graph Γ, with adjacency matrix A, is a linear combination of A, the diagonal matrix D of vertex degrees, the identity matrix I, and the all-1 matrix J with real coefficients, that is, U=c1A+c2D+c3I+c4J, with ci
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::63d7f75a3d1b0f657f900179c41830cb
https://doi.org/10.1080/03081087.2022.2042174
https://doi.org/10.1080/03081087.2022.2042174
Autor:
Elatifi, Kamal
Graph topology inference is a research field that studies how to learn the structure of a graph from data related to it. It is a very popular research topic in which algorithms are being developed faster and more efficient year after year. Graphs are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3484::dd1e656b6424df1bc08e6fd41f16cbe8
https://hdl.handle.net/2117/387259
https://hdl.handle.net/2117/387259
Autor:
Lázaro Trilles, Carla
Utilitzar filtre en grafs per a predir la topologia d'un graf. This project will focus on the development of methods to predict relations (links) between elements (nodes) of a network structured in a graph. In order to study these systems, the graphs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3484::0fd2c0b3172f70f748e9a926975d5ddb
https://hdl.handle.net/2117/385652
https://hdl.handle.net/2117/385652
The development of the project has been contextualized in LEO satellite constellations and the possibilities they offer as a communications network, with particular focus on ground-to-air communications (aircraft). The initial objective of this thesi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3484::9d9286feda817248611584629553a024
https://hdl.handle.net/2117/386140
https://hdl.handle.net/2117/386140
Autor:
Jané Ballarín, Martí
We study the complexity of computing the Banzhaf index in incompatibility games. We show: 1) weak #P-completeness for computing the index when the incompatibility graph has very few maximal independent sets, 2) strong #P-completeness if the incompati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3484::ee30324fbf34b19424be4ca4cceb4b8d
https://hdl.handle.net/2117/385666
https://hdl.handle.net/2117/385666
Autor:
Xu, Yinlena
Nowadays, businesses are faced with an overwhelming amount of data. Companies are using data-driven solutions to improve decision making and stay competitive, especially in the supply chain industry where data management and analysis can improve oper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3484::49258dc801eb313e5a048d46b94bfd7c
https://hdl.handle.net/2117/383853
https://hdl.handle.net/2117/383853
Publikováno v:
Digital.CSIC. Repositorio Institucional del CSIC
instname
instname
Network Alignment (NA) is a hard optimization problem with important applications such as, for example, the identification of orthologous relationships between different proteins and of phylogenetic relationships between species. Given two (or more)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2797120a8d3e996875433a860c5e1abe
https://hdl.handle.net/2117/378213
https://hdl.handle.net/2117/378213
We prove that the ribbon graph polynomial of a graph embedded in an orientable surface is irreducible if and only if the embedded graph is neither the disjoint union nor the join of embedded graphs. This result is analogous to the fact that the Tutte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0f5e24c9d91301dbb8c2d736b20b60c5
http://arxiv.org/abs/2212.10920
http://arxiv.org/abs/2212.10920
Autor:
Hurtado Comín, Carlos
Amb l'augment de la mida de les dades, els sistemes efectius de reducció de la dimensionalitat s'han tornat necessaris per una gran varietat de tasques. Un conjunt de dades es pot caracteritzar per les seves propietats geomètriques, entre les quals
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3484::8bd338fa8d87f7852eb6d5e83d6ca211
https://hdl.handle.net/2117/376797
https://hdl.handle.net/2117/376797