Results 31 to 40 of about 11,781 (210)
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
Journal of Combinatorial Theory, Series B, 1993 We are concerned with a natural generalization of the matching problem: the packing of graphs from a pregiven family. We characterize completely the complexity of deciding the existence of a perfect packing, if the pregiven family consists of two graphs, one of which is one edge on two vertices. Our results complete the work of G.
Loebl, M., Poljak, S.
openaire +1 more source
Strong subgraph k‐connectivity [PDF]
Journal of Graph Theory, 2018 AbstractGeneralized connectivity introduced by Hager [J. Combin. Theory Ser. B 38 (1985), pp. 179–189] has been studied extensively in undirected graphs and become an established area in undirected graph theory. For connectivity problems, directed graphs can be considered as generalizations of undirected graphs.
Yuefang Sun +3 more
openaire +3 more sources
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
Forbidden subgraph decomposition
Discrete Mathematics, 2002 no ...
Rusu, Irena, Spinrad, Jeremy P.
openaire +2 more sources
SPARQL beyond Subgraph Matching [PDF]
, 2010 We extend the Semantic Web query language SPARQL by defining the semantics of SPARQL queries under the entailment regimes of RDF, RDFS, and OWL. The proposed extensions are part of the SPARQL 1.1 Entailment Regimes working draft which is currently being developed as part of the W3C standardization process of SPARQL 1.1.
Glimm, B, Krötzsch, M
openaire +3 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
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
Counting Unbranched Subgraphs [PDF]
Journal of Algebraic Combinatorics, 1999 For a given graph \(G=(V,E)\), its unbranched subgraph is defined to be an edge-induced spanning subgraph such that the degree of each vertex is not greater than 2. The main result shows that the real part of any root of the polynomial \[ Q(z)=\sum_{F}z^{| F| }, \] where \(F\) is taken over all the subsets of \(E\) such that \(F\) forms an unbranched ...
openaire +2 more sources
IEEE Access, 2021 Social Internet of Things (SIoT) is extended to integrate social networks in the Internet of Things (IoT). SIoT enriches IoT, and thus resource (or service) discovery and consolidation in SIoT becomes an important and challenging problem.
Xiaolin Fan +4 more
doaj +1 more source