Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Matroid_embedding> ?p ?o }
Showing triples 1 to 28 of
28
with 100 triples per page.
- Matroid_embedding abstract "In combinatorics, a matroid embedding is a set system (F, E), where F is a collection of feasible sets, that satisfies the following properties: (Accessibility Property) Every non-empty feasible set X contains an element x such that X\{x} is feasible; (Extensibility Property) For every feasible subset X of a basis (i.e., maximal feasible set) B, some element in B but not in X belongs to the extension ext(X) of X, or the set of all elements e not in X such that X∪{e} is feasible; (Closure-Congruence Property) For every superset A of a feasible set X disjoint from ext(X), A∪{e} is contained in some feasible set for either all or no e in ext(X); The collection of all subsets of feasible sets forms a matroid.Matroid embedding was introduced by Helman et al. in 1993 to characterize problems that can be optimized by a greedy algorithm.".
- Matroid_embedding wikiPageID "735426".
- Matroid_embedding wikiPageLength "1326".
- Matroid_embedding wikiPageOutDegree "7".
- Matroid_embedding wikiPageRevisionID "675336536".
- Matroid_embedding wikiPageWikiLink Category:Matroid_theory.
- Matroid_embedding wikiPageWikiLink Combinatorics.
- Matroid_embedding wikiPageWikiLink Family_of_sets.
- Matroid_embedding wikiPageWikiLink Greedy_algorithm.
- Matroid_embedding wikiPageWikiLink Matroid.
- Matroid_embedding wikiPageWikiLink SIAM_Journal_on_Discrete_Mathematics.
- Matroid_embedding wikiPageWikiLink Set_system.
- Matroid_embedding wikiPageWikiLink Subset.
- Matroid_embedding wikiPageWikiLink Superset.
- Matroid_embedding wikiPageWikiLinkText "Matroid embedding".
- Matroid_embedding wikiPageWikiLinkText "matroid embedding".
- Matroid_embedding hasPhotoCollection Matroid_embedding.
- Matroid_embedding wikiPageUsesTemplate Template:Cite_journal.
- Matroid_embedding subject Category:Matroid_theory.
- Matroid_embedding hypernym System.
- Matroid_embedding type Combinatoric.
- Matroid_embedding comment "In combinatorics, a matroid embedding is a set system (F, E), where F is a collection of feasible sets, that satisfies the following properties: (Accessibility Property) Every non-empty feasible set X contains an element x such that X\{x} is feasible; (Extensibility Property) For every feasible subset X of a basis (i.e., maximal feasible set) B, some element in B but not in X belongs to the extension ext(X) of X, or the set of all elements e not in X such that X∪{e} is feasible; (Closure-Congruence Property) For every superset A of a feasible set X disjoint from ext(X), A∪{e} is contained in some feasible set for either all or no e in ext(X); The collection of all subsets of feasible sets forms a matroid.Matroid embedding was introduced by Helman et al. ".
- Matroid_embedding label "Matroid embedding".
- Matroid_embedding sameAs m.036wmd.
- Matroid_embedding sameAs Q6787902.
- Matroid_embedding sameAs Q6787902.
- Matroid_embedding wasDerivedFrom Matroid_embedding?oldid=675336536.
- Matroid_embedding isPrimaryTopicOf Matroid_embedding.