About: Gammoid     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/c/6cYfdX1KAa

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 .

AttributesValues
rdfs:label
  • Gammoid (en)
rdfs:comment
  • 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 . (en)
dct:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
authorlink
  • Hazel Perfect (en)
first
  • Hazel (en)
last
  • Perfect (en)
year
has abstract
  • 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 . (en)
gold:hypernym
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git147 as of Sep 06 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3332 as of Dec 5 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 68 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software