Zobrazeno 1 - 10
of 1 870
pro vyhledávání: '"similarity of graphs"'
Autor:
Daza, Daniel, Chu, Cuong Xuan, Tran, Trung-Kien, Stepanova, Daria, Cochez, Michael, Groth, Paul
Similarity search is a fundamental task for exploiting information in various applications dealing with graph data, such as citation networks or knowledge graphs. While this task has been intensively approached from heuristics to graph embeddings and
Externí odkaz:
http://arxiv.org/abs/2407.07639
One way of characterizing the topological and structural properties of vertices and edges in a graph is by using structural similarity measures. Measures like Cosine, Jaccard and Dice compute the similarities restricted to the immediate neighborhood
Externí odkaz:
http://arxiv.org/abs/1805.01419
Autor:
Nikolic, Mladen
The problem of measuring similarity of graphs and their nodes is important in a range of practical problems. There is a number of proposed measures, some of them being based on iterative calculation of similarity between two graphs and the principle
Externí odkaz:
http://arxiv.org/abs/1009.5290
An old problem raised independently by Jacobson and Sch\"onheim asks to determine the maximum $s$ for which every graph with $m$ edges contains a pair of edge-disjoint isomorphic subgraphs with $s$ edges. In this paper we determine this maximum up to
Externí odkaz:
http://arxiv.org/abs/1201.0924
Autor:
Dzido, Tomasz, Krzywdziński, Krzysztof
Publikováno v:
In Discrete Mathematics 6 June 2015 338(6):983-989
Publikováno v:
In Information Systems June 2014 42:107-122
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:
Journal of Mechanical Engineering and Transport. 15:67-79
For the analysis of designs of cars of various designs the idea of application of graphs of such designs is offered. Using structural notation of structural schemes of machines will organize and formalize the widest range of machines, apply the same
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6da745398bd269b4b56fa14c57993b84
https://doi.org/10.31649/2413-4503-2022-15-1-67-79
https://doi.org/10.31649/2413-4503-2022-15-1-67-79
Publikováno v:
Physical Review A. 101
Gaussian boson samplers (GBSs) have initially been proposed as a near-term demonstration of classically intractable quantum computation. We show here that they have a potential practical application: Samples from these devices can be used to construc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe41291cbcf06fa9f4eb76f6b01dab5a
https://doi.org/10.1103/physreva.101.032314
https://doi.org/10.1103/physreva.101.032314