Examples of 'subgraphs' in a sentence
Meaning of "subgraphs"
subgraph (noun) - in computer science, a subset of vertices and edges of a graph, used to represent a smaller section of the overall graph
Show more definitions
- plural of subgraph
How to use "subgraphs" in a sentence
Basic
Advanced
subgraphs
It asks for which subgraphs this is possible.
Determine if two graphs have isomorphic subgraphs.
Important types of induced subgraphs include the following.
Operators for extracting and returning subgraphs.
The statistical analysisof subgraphs is fulfilled in the thesis.
All subgraphs within a given cut are tacitly conjoined.
A similar problem is finding induced subgraphs in a given graph.
We exploit subgraphs mining to discover repeated patterns in a system.
Induced cycles are induced subgraphs or cycles.
These subgraphs have a very good description in natural language.
A graph entails all its subgraphs.
Subgraphs and supergraphs.
A similar phenomenon also applies to the subgraphs induced by modules.
Comparability graphs can also be characterized by a list of forbidden induced subgraphs.
It consists to enumerate the subgraphs of a data graph that match a query graph.
See also
The strong components are the maximal strongly connected subgraphs.
And reports the agreement between two subgraphs beyond chance expectation.
Those subgraphs are used to define a kernel that take into account the stereochemistry.
One characterization of a chordal graph is as the intersection graph of connected subgraphs of a tree.
Line graphs are characterized by nine forbidden subgraphs and can be recognized in linear time.
All these relations can be explained in terms of their characterisation by forbidden induced subgraphs.
Determination of common eigenvalues by embedding smaller subgraphs onto larger ones is illustrated.
Convex subgraphs play an important role in the theory of partial cubes and median graphs.
Cliques and independent sets are induced subgraphs that are respectively complete graphs or edgeless graphs.
This simplification preferably eliminates certain links and can then result in multiple subgraphs.
Closely related concepts to complete subgraphs are subdivisions of complete graphs and complete graph minors.
Graphs with this property may decompose into more than two positive subgraphs called clusters.
The components are then the induced subgraphs formed by the equivalence classes of this relation.
The cycle space of a graph is the collection of its Eulerian spanning subgraphs.
These two subsets define two subgraphs with almost similar distances between their vertices.
The first one is a problem of graph partition into dense subgraphs for unsupervised learning.
Sachs subgraphs are also named after Sachs.
The face cycles of these embeddings generate a proper subset of all Eulerian subgraphs.
These subgraphs are all isomorphic to the complement graph of the Clebsch graph.
A universal graph for a family F of graphs is a graph that contains every member of F as a subgraphs.
Subgraphs of the Twitter network.
Otherwise, we recursively generate the two subgraphs.
Unfortunately, finding maximal subgraphs of a certain kind is often an NP-complete problem.
They were the first to call complete subgraphs "cliques.
The study of complete subgraphs in mathematics predates the " clique " terminology.
That is, it is a maximal element of the subgraphs with the property.
What if we want the subgraphs induced bythe vertex-partition to be more than connected?
We calculate the expected number of monochromatic subgraphs on r vertices as follows,.
We define minimal stereo subgraphs, which are subgraphs that locally characterizes the stereochemistry.
In the second part, we focus on the detection of specific induced subgraphs.
First, percolation of temporal subgraphs constructed of consecutive communication events is studied.
A cograph is a graph all of whose connected induced subgraphs have diameter at most 2.
Indifference graphs obey the reconstruction conjecture, they are uniquely determined by their vertex-deleted subgraphs.
Unfortunately finding maximal subgraphs of a certain kind is often a NP-complete problem.
A common problem, called subgraph isomorphism problem, is finding subgraphs in a given graph.
