Figure 3: Subgraph Split Procedure Takes an Initial Semantic Subgraph (Q) and Produces Two Smaller Semantic Subgraphs (D1andD2) Using All Vertices (V) From (Q).

doi 10.7717/peerj.1558/fig-3
Full Text
Abstract

Available in full text

Date

Unknown

Authors

Unknown

Publisher

PeerJ

Related search

Semantic Ontology Method of Learning Resource Based on the Approximate Subgraph Isomorphism

Journal of Multimedia
2014English

Subgraph Matching

Proceedings of the VLDB Endowment
Computer Science
2017English

Subgraph Matching Using Graph Neural Network

Journal of Intelligent Learning Systems and Applications
2012English

An Initial Analysis of Semantic Wikis

2013English

Bypass Strong V-Structures and Find an Isomorphic Labelled Subgraph in Linear Time

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Vertex Decompositions of Sparse Graphs Into an Edgeless Subgraph and a Subgraph of Maximum Degree at Most K

Journal of Graph Theory
GeometryTopology
2009English

Learning a Hidden Subgraph

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Mining Frequent Subgraph Patterns From Uncertain Graphs

Ruan Jian Xue Bao/Journal of Software
Software
2009English

Efficient Subgraph Matching on Large RDF Graphs Using MapReduce

Data Science and Engineering
Computational MechanicsComputer Science Applications
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy