单词 subgraph 释义 BETA

Examples ofsubgraph

Dictionary> Examples ofsubgraphsubgraphisn’t in the Cambridge Dictionary yet. You can help!Add a definitionA correctness graph of a proof structure is asubgraphof that is obtained by erasing one premise for each -link.From theCambridge English CorpusOnly safe nodes are eligible forsubgraphsharing.From theCambridge English CorpusWhen applied to chart-based parsing or generation,subgraphsharing can yield significant improvements in efficiency.From theCambridge English CorpusThus, f(m) is the largest integer f such that any graph with m edges contains a bipartitesubgraphwith at least f(m) edges.From theCambridge English CorpusA block is a maximal 2-vertex-connectedsubgraph.From theCambridge English CorpusIt seems plausible that finding such asubgraphshould not be a very difficult task.From theCambridge English CorpusFirst, dispose of a pathological case: when there exists a very large complete bipartitesubgraph.From theCambridge English CorpusTo describe the inducedsubgraphin our coupling, we now make a few definitions.From theCambridge English CorpusA 'biased graph' is a graph with a family of distinguished, 'balanced', cycles such that no thetasubgraphcontains exactly two balanced cycles.From theCambridge English CorpusTo be exact, the list does not contain all such graphs, but they are ordered tosubgraphchains and only the minimal elements are taken.From theCambridge English CorpusSharing of argument evaluation in an application is implemented by sharing thesubgraphrepresenting the argument term; this is 'obviously correct'.From theCambridge English CorpusThis greatly limits the improvement in efficiency thatsubgraphsharing can offer.From theCambridge English CorpusHence, we can use an iterative improvement search algorithm for the largest commonsubgraphcomputation.From theCambridge English CorpusAs a matter of fact, no benchmark has been developed yet for thesubgraphisomorphism problem.From theCambridge English CorpusHere, the mappings must be exact: each element of the shape pattern from the source must match, and so the algorithm is computingsubgraphisomorphisms.From theCambridge English CorpusThe desiredsubgraphcomprises the central hexagon together with the six incident half-edges, providing the edge-disjointness needed in the decomposition.From theCambridge English CorpusBy a 'spanning forest', we mean asubgraphwithout cycles that contains every vertex.From theCambridge English CorpusWe compute the expected number of a-sets of vertices inducing such asubgraph.From theCambridge English CorpusUnless stated otherwise, by asubgraphwe will always mean a spanningsubgraph.From theCambridge English Corpus

These examples are from corpora and from sources on the web. Any opinions in the examples do not represent the opinion of the Cambridge Dictionary editors or of Cambridge University Press or its licensors.