Gammoid
http://dbpedia.org/resource/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 Hazel Perfect, based on considerations related to Menger's theorem characterizing the obstacles to the existence of systems of disjoint paths. Gammoids were given their name by and studied in more detail by .
rdf:langString
rdf:langString
Gammoid
xsd:integer
26952253
xsd:integer
1096181911
rdf:langString
Hazel Perfect
rdf:langString
Hazel
rdf:langString
Perfect
xsd:integer
1968
rdf:langString
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 Hazel Perfect, based on considerations related to Menger's theorem characterizing the obstacles to the existence of systems of disjoint paths. Gammoids were given their name by and studied in more detail by .
xsd:nonNegativeInteger
10165