翻訳と辞書 Words near each other ・ "O" Is for Outlaw ・ "O"-Jung.Ban.Hap. ・ "Ode-to-Napoleon" hexachord ・ "Oh Yeah!" Live ・ "Our Contemporary" regional art exhibition (Leningrad, 1975) ・ "P" Is for Peril ・ "Pimpernel" Smith ・ "Polish death camp" controversy ・ "Pro knigi" ("About books") ・ "Prosopa" Greek Television Awards ・ "Pussy Cats" Starring the Walkmen ・ "Q" Is for Quarry ・ "R" Is for Ricochet ・ "R" The King (2016 film) ・ "Rags" Ragland ・ ! (album) ・ ! (disambiguation) ・ !! ・ !!! ・ !!! (album) ・ !!Destroy-Oh-Boy!! ・ !Action Pact! ・ !Arriba! La Pachanga ・ !Hero ・ !Hero (album) ・ !Kung language ・ !Oka Tokat ・ !PAUS3 ・ !T.O.O.H.! ・ !Women Art Revolution Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク gammoid ： ウィキペディア英語版 gammoid In matroid theory, a field within mathematics, a gammoid is a certain kind of matroid, describing sets of vertices that can be reached by vertex-disjoint paths in a directed graph. The concept of a gammoid was introduced and shown to be a matroid by , based on considerations related to Menger's theorem characterizing the obstacles to the existence of systems of disjoint paths.〔.〕 Gammoids were studied in more detail and given their name by .〔.〕 ==Definition== Let $G$ be a directed graph, $S$ be a set of starting vertices, and $T$ be a set of destination vertices (not necessarily disjoint from $S$). The gammoid $\backslash Gamma$ derived from this data has $T$ as its set of elements. A subset $I$ of $T$ is independent in $\backslash Gamma$ if there exists a set of vertex-disjoint paths whose starting points all belong to $S$ and whose ending points are exactly $I$.〔.〕 A strict gammoid is a gammoid in which the set $T$ of destination vertices consists of every vertex in $G$. Thus, a gammoid is a restriction of a strict gammoid, to a subset of its elements.〔 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「gammoid」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.