| 意味 | 共起表現 |
「Matroid」の共起表現一覧(1語右で並び替え)
該当件数 : 28件
| If the elements of the | matroid are assigned real weights, the weighted matro |
| The sign labels, instead of changing the | matroid, become signs on the elements of the matroid. |
| In particular, the structure of oriented | matroid contains full information on the incidence re |
| To contract a link (a non-loop) in the | matroid, contract it in the graph in the usual way. |
| s, and results in a partition of the set M of | matroid elements into two subsets A and B. If ρ denot |
| Matroid embedding was introduced by Helman et al. in | |
| The | matroid intersection problem becomes NP-hard when thr |
| In combinatorial optimization, the | matroid intersection problem is to find a largest com |
| A branch-decomposition of a | matroid is a hierarchical clustering of the matroid e |
| any submatroid or contraction of a bicircular | matroid is also a bicircular matroid. |
| In mathematics, a colored | matroid is a matroid whose elements are labeled from |
| The branchwidth of a | matroid is equal to the branchwidth of its dual, and |
| loop at w. Any other graph loops at v become | matroid loops-to describe this correctly in terms of |
| the branchwidth of the corresponding graphic | matroid may differ: for instance, the three-edge path |
| One may define a | matroid MU on the ground set E, in which a set of edg |
| The | matroid of a sign-colored graph is the cycle matroid |
| These hyperplanes are studied via the lift | matroid of the gain graph (Zaslavsky 2003). |
| ese hyperplanes are treated through the frame | matroid of the gain graph (Zaslavsky 2003). |
| The closed sets (flats) of the bicircular | matroid of a graph G can be described as the forests |
| d circulations, spanning trees, matching, and | matroid problems. |
| underlying graph: To delete an edge from the | matroid, remove it from the graph. |
| dependent" sets which is a down-set but not a | matroid, then the greedy algorithm will not always wo |
| ptomorphic concepts in mathematics outside of | matroid theory and universal algebra, the word has no |
| ever, in fairly wide use among researchers in | matroid theory. |
| n scope) by Gian-Carlo Rota in the context of | matroid theory: there are dozens of equivalent axioma |
| 意味 | 共起表現 |
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|