「VERTEX」の共起表現(1語右が「set」) - Weblio英語共起表現検索

Weblio 辞書 > 英和辞典・和英辞典 > VERTEXの意味・解説 > VERTEXに関連した共起表現

共起表現

「VERTEX」の共起表現一覧(1語右が「set」)

該当件数 : 25件

A graph is said to be k-varigated if its	vertex set can be partitioned into k equal parts such
Furthermore, the feedback	vertex set problem has applications in VLSI chip desi
w-symmetric directed graph G(V, E) composed of	vertex set V and directed edge set E. Each vertex in
Take U as the	vertex set in the hypergraph, and V as set of edges.
In graph theory, a graph G with	vertex set V(G) is said to be k-vertex-connected (or
treated by using the following gain graph: The	vertex set is {1,2,...,n}.
S are subsets of G such that , where V is the	vertex set of G.
iplines, a bivariegated graph is a graph whose	vertex set can be partitioned into two equal parts su
blem of finding the size of a minimum feedback	vertex set can be solved in time O(1.7347n),
ant is "large" if any possible division of the	vertex set into two subsets has "many" links between
p F: Kn → Kn is the finite directed graph with	vertex set Kn and directed edges (x, F(x)).
logue of the) unit interval is the graph whose	vertex set is {0,1} and which contains a single edge
aph, (U ∪ V, E), is said to be convex over the	vertex set U if U can be enumerated such that for all
lity graph of a poset (P, ≤) is the graph with	vertex set P in which the edges are those pairs of di
e set Q, we naturally address the digraph with	vertex set Q induced by its transition relation.
aph, then the cube of G (the graph on the same	vertex set that has an edge between every two vertice
e, then the square of G (the graph on the same	vertex set that has an edge between every two vertice
s closer in order (in terms of the size of the	vertex set) to the Moore bound is considered an open
For example, take the	vertex set to be all the points in the plane (x,y) wi
responds a signed complete graph Σ on the same	vertex set, whose edges are signed negative if in G a
Formally, it is the graph with	vertex set S in which any points P and Q in S are adj
e graph, with the reachability ordering on the	vertex set) into layers (sets of vertices with the sa
Given a multigraph M, take U as the	vertex set of M and take V as the edge set of M. Then
possible graph G (in terms of the size of its	vertex set V) of diameter k such that the largest deg

共起表現の隣合う単語の集計結果ページに戻る

意味

例文

類語

共起表現