Results 41 to 50 of about 27,298 (312)
Weighted enclosing subgraph-based link prediction for complex network
EURASIP Journal on Wireless Communications and Networking, 2022 Link prediction is a fundamental research issue in complex network, which can reveal the potential relationships between users. Most of link prediction algorithms are heuristic and based on topology structure.
Weiwei Yuan +6 more
doaj +1 more source
Subgraph Matching Cardinality Estimation Combining Heuristic and Boosting Method [PDF]
Jisuanji kexue yu tansuo, 2022 Attributed to its innate advantage in modeling relational information, graph data have been widely leveraged in various applications including social network, knowledge representation, etc. Compared with traditional relational database systems, primitive
HOU Wenzhe, ZHAO Xiang
doaj +1 more source
Combinatorics, Probability and Computing, 2023 AbstractA chordal graph is a graph with no induced cycles of length at least $4$ . Let $f(n,m)$ be the maximal integer such that every graph with $n$ vertices and $m$ edges has a chordal subgraph with at least $f(n,m)$ edges. In 1985 Erdős and Laskar posed the problem of estimating $f(n,m)$ .
Lior Gishboliner, Benny Sudakov
openaire +2 more sources
Distributed Representations of Subgraphs
2017 IEEE International Conference on Data Mining Workshops (ICDMW), 2017 9 pages, 7 ...
Bijaya Adhikari +3 more
openaire +2 more sources
A coding method for efficient subgraph querying on vertex- and edge-labeled graphs. [PDF]
PLoS ONE, 2014 Labeled graphs are widely used to model complex data in many domains, so subgraph querying has been attracting more and more attention from researchers around the world.
Lei Zhu +5 more
doaj +1 more source
Capturing Topology in Graph Pattern Matching [PDF]
, 2011 Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead.
Huai, Jinpeng +9 more
core +1 more source
Subgraph-aware Few-Shot Inductive Link Prediction via Meta-Learning
, 2022 Link prediction for knowledge graphs aims to predict missing connections between entities. Prevailing methods are limited to a transductive setting and hard to process unseen entities.
Mai, S, Zheng, S, Yang, Y, Hu, H, Sun, Y
core +1 more source
Supersaturation for Subgraph Counts
Graphs and Combinatorics, 2022 The classic extremal problem is that of computing the maximum number of edges in an $F$-free graph. In the case where $F=K_{r+1}$, the extremal number was determined by Turán. Later results, known as supersaturation theorems, proved that in a graph containing more edges than the extremal number, there must also be many copies of $K_{r+1}$.
Jonathan Cutler +2 more
openaire +3 more sources
Connected Tropical Subgraphs in Vertex-Colored Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 A subgraph of a vertex-colored graph is said to be tropical whenever it contains each color of the graph. In this work we study the problem of finding a minimal connected tropical subgraph.
Jean-Alexandre Anglès d'Auriac +5 more
doaj +1 more source
Testing first-order properties for subclasses of sparse graphs [PDF]
, 2013 We present a linear-time algorithm for deciding first-order (FO) properties in classes of graphs with bounded expansion, a notion recently introduced by Nešetřil and Ossona de Mendez.
Thomas, Robin +2 more
core +1 more source