Stack Overflow
Stack Overflow

Questions tagged [subgraph]

Use this tag for questions related to a Subgraph, a part of a larger graph.

313 questions
0
votes
1 answer

Neo4j Cypher: Match and Delete the subgraph based on value of node property

Suppose I have 3 subgraphs in Neo4j and I would like to select and delete the whole subgraph if all the nodes in the subgraph matching the filtering criteria that is each node's property value <= 1. However if there is atleast one node within the…
sjishan
  • 3,392
  • 9
  • 29
  • 53
0
votes
0 answers

Common Subgraphs

I want to use first part of code to find common components of the subgraphs in the second part of code. So I don't want to change the second part of code, I want to modify the first one, so that it works using Graphs defined in the second part. I…
A.Kris
  • 31
  • 5
0
votes
1 answer

Identification of closed cells in a graph

I have a graph where nodes represent points in 3D space. Each node is connected only to all other nodes within some cutoff radius. I am trying to enumerate all subgraphs such that the nodes represent the vertices of a polyhedron with no interior…
beardslay
  • 41
  • 2
0
votes
1 answer

The number of connected (!) subgraphs is exponential?

i want to show that for an example graph family the nummer of connected subgraphs grows expnential with n. That is easy to show for a complete graph, because a complete graph has n(n-1)/2 = n over 2 edges. One edge is either in the subgraph or not.…
Perhalo
  • 85
  • 8
0
votes
1 answer

output the names/ids list of node for subgraph (subisomorphisms)

I would like to count the number of the full 3-node subgraphs. Nodes of the original graph have names. The example code is below. g <- graph.full(n=5, directed = TRUE) # adjacency matrices d3<-matrix(c(0,1,1,1,0,1,1,1,0),nrow=3,ncol=3) # Turn…
Nick
  • 1,086
  • 7
  • 21
0
votes
0 answers

connect subgraphs in optimal way

How can i connect two graphs by a bridge(link) in an optimal way? There are some criteria such as weight of each link, stability of link (connection quality), expected time for connection, etc. I am wondering how I can define a cost function based…
AbbasTari
  • 1
  • 3
0
votes
1 answer

Subgraph function from networknx python

I would like to ask if there is someone who could help me understand subgraph function from this python module. E.g on some simple graph. Subgraph function is between lines 1400 and…
user2938332
  • 133
  • 1
  • 1
  • 9
0
votes
2 answers

Does GraphX support subgraph queries?

I have loaded a big graph and a small graph (which is to be my query) using the GraphX API and what I want to do it to check whether the big graph contains the query graph.I searched on the web about subgraph/graph queries with GraphX and I can't…
Iva
  • 357
  • 5
  • 13
0
votes
1 answer

OrientDB traverse using intersection condition for node-property

Please apologize, I'm new on stackoverflow and completely new to OrientDB. I have the following, simple test-structure in OrientDB: different connected nodes, which have a list of tags as property I want to show only the part of the graph (nodes…
h.bisch
  • 51
  • 6
0
votes
1 answer

How to create two subgraphs from a given graph

Suppose a given directed graph G with N vertices and M edges. How is it possible to create from the existing M connections of the graph G two subgraphs S_1 and S_2. These respective subgraphs each have half of the existing edges. Furthermore it is…
Fulla
  • 17
  • 6
0
votes
0 answers

processors inspection of a subgraph in a distributed graph

I have a huge distributed undirected graph which is made of thousands of sub-graphs, where each one is distributed over some processors. Is there a way to know which processors every distributed sub-graph is passing through.
ziv
  • 189
  • 1
  • 9
0
votes
0 answers

How to combine the subgraphs retaining the edge attributes?

I have been trying to combine the subgraphs preserving the original edge attributes using graph.union function in igraph. Operation was successful but the new graph forgot its edge attributes. I have even tried the options mentioned here but it…
gp771
  • 1
  • 4
0
votes
0 answers

How to search a subgraph composed of 2 property linked to a specific root node using SPARQL?

I'm trying to querying with SPARQL on a triplestore storing datasets (I speak about a specific group of data stored in a global graph of a triplestore dataset) with metadatas. The metadatas describe how the data are computed. Each datasets has his…
Thibaut Guirimand
  • 851
  • 10
  • 33
0
votes
1 answer

subgraph and graph connectivity in boost

I want to know if there are some predefined functions to get those two tests results as a boolean in BOOST, then i will put the code (in an UPDATE). 1- if graph g1 is a subgraph of g2 (by giving g1 and g2 as a function parameter). here…
KHALDOUN Mohsen
  • 57
  • 9
0
votes
1 answer

Any library or proposed solution for subgraph (path) matching within a graph?

For example, there is a graph, which can be represented as an adjacency matrix as G = {{ 0, 1, 0 }, { 1, 0, 1 }, { 1, 0, 0 }} Thus, there are four directed edges: node_1 to node_2, node_2 to node_3, node_2 to node_1 and node_3 to node_1. What I…
Xingsheng Guo
  • 71
  • 10
1 2 3
…
20 21