Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Graph degeneracy"'
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:
Alipour Maryam, Tittmann Peter
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 3, Pp 697-711 (2021)
The neighborhood polynomial of graph G is the generating function for the number of vertex subsets of G of which the vertices have a common neighbor in G. In this paper, we investigate the behavior of this polynomial under several graph operations. S
Externí odkaz:
https://doaj.org/article/e61f1f25a1fe4c1a99db1fb02f52dd2e
Publikováno v:
Applied Network Science, Vol 6, Iss 1, Pp 1-21 (2021)
Abstract Relationships between legal entities can be represented as a large weighted directed graph. In this work, we model the global capital ownership network across a hundred of millions of such entities with the goal of establishing a methodology
Externí odkaz:
https://doaj.org/article/da096a48d72d4a6e9ce0ddd22326a39e
Autor:
Seshadhri, C.
Subgraph counting is a fundamental problem that spans many areas in computer science: database theory, logic, network science, data mining, and complexity theory. Given a large input graph G and a small pattern graph H, we wish to count the number of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a731b905be45cf04365a0526610b59ca
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.
Publikováno v:
Applied Network Science, Vol 6, Iss 1, Pp 1-21 (2021)
Relationships between legal entities can be represented as a large weighted directed graph. In this work, we model the global capital ownership network across a hundred of millions of such entities with the goal of establishing a methodology for extr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad8f1434d3d20c9b83c7993c01be0243
https://doaj.org/article/da096a48d72d4a6e9ce0ddd22326a39e
https://doaj.org/article/da096a48d72d4a6e9ce0ddd22326a39e
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.
Publikováno v:
Artificial Intelligence Applications and Innovations. AIAI 2020 IFIP WG 12.5 International Workshops
The purpose of this paper is the expansion of the set-based model, namely an information retrieval model, with the use of graphs. The indexing process implements a graphical representation, while the querying and document representation are based on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmc_________::9a4efa55b84e7a3089d7712e522ccb91
http://europepmc.org/articles/PMC7256422
http://europepmc.org/articles/PMC7256422
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2020, 839, pp.164-175. ⟨10.1016/j.tcs.2020.06.006⟩
Theoretical Computer Science, Elsevier, 2020, 839, pp.164-175. ⟨10.1016/j.tcs.2020.06.006⟩
We consider a cops and robber game where the cops are blocking edges of a graph, while the robber occupies its vertices. At each round of the game, the cops choose some set of edges to block and right after the robber is obliged to move to another ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::41c8a9897a777e5deb3a69d9adcd623c
https://hal.archives-ouvertes.fr/hal-03001062/file/2009.03809.pdf
https://hal.archives-ouvertes.fr/hal-03001062/file/2009.03809.pdf
Autor:
Limnios, Stratis
Publikováno v:
Artificial Intelligence [cs.AI]. Institut Polytechnique de Paris, 2020. English. ⟨NNT : 2020IPPAX038⟩
Extracting Meaningful substructures from graphs has always been a key part in graph studies. In machine learning frameworks, supervised or unsupervised, as well as in theoretical graph analysis, finding dense subgraphs and specific decompositions is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2592::00c95353341631e8e7af9ee4ff6b25a2
https://tel.archives-ouvertes.fr/tel-03046826/document
https://tel.archives-ouvertes.fr/tel-03046826/document