Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Matroid_intersection> ?p ?o }
Showing triples 1 to 38 of
38
with 100 triples per page.
- Matroid_intersection abstract "In combinatorial optimization, the matroid intersection problem is to find a largest common independent set in two matroids over the same ground set. If the elements of the matroid are assigned real weights, the weighted matroid intersection problem is to find a common independent set with the maximum possible weight. These problems generalize many problems in combinatorial optimization including finding maximum matchings and maximum weight matchings in bipartite graphs and finding arborescences in directed graphs.The matroid intersection theorem, due to Jack Edmonds, says that there is always a simple upper bound certificate, consisting of a partitioning of the ground set amongst the two matroids, whose value (sum of respective ranks) equals the size of a maximum common independent set. Based on this theorem, the matroid intersection problem for two matroids can be solved in polynomial time using matroid partitioning algorithms.".
- Matroid_intersection wikiPageID "23258067".
- Matroid_intersection wikiPageLength "5156".
- Matroid_intersection wikiPageOutDegree "22".
- Matroid_intersection wikiPageRevisionID "683711143".
- Matroid_intersection wikiPageWikiLink Arborescence_(graph_theory).
- Matroid_intersection wikiPageWikiLink Bipartite_graph.
- Matroid_intersection wikiPageWikiLink Category:Combinatorial_optimization.
- Matroid_intersection wikiPageWikiLink Category:Matroid_theory.
- Matroid_intersection wikiPageWikiLink Combinatorial_optimization.
- Matroid_intersection wikiPageWikiLink Directed_graph.
- Matroid_intersection wikiPageWikiLink Graph_(discrete_mathematics).
- Matroid_intersection wikiPageWikiLink Graphic_matroid.
- Matroid_intersection wikiPageWikiLink Hamiltonian_path.
- Matroid_intersection wikiPageWikiLink Jack_Edmonds.
- Matroid_intersection wikiPageWikiLink Matching_(graph_theory).
- Matroid_intersection wikiPageWikiLink Matroid.
- Matroid_intersection wikiPageWikiLink Matroid_partitioning.
- Matroid_intersection wikiPageWikiLink Matroid_rank.
- Matroid_intersection wikiPageWikiLink NP-hardness.
- Matroid_intersection wikiPageWikiLink Partition_matroid.
- Matroid_intersection wikiPageWikiLink Reduction_(complexity).
- Matroid_intersection wikiPageWikiLinkText "intersection".
- Matroid_intersection wikiPageWikiLinkText "intersections".
- Matroid_intersection wikiPageWikiLinkText "matroid intersection".
- Matroid_intersection wikiPageUsesTemplate Template:Citation.
- Matroid_intersection wikiPageUsesTemplate Template:Harv.
- Matroid_intersection subject Category:Combinatorial_optimization.
- Matroid_intersection subject Category:Matroid_theory.
- Matroid_intersection type Algorithm.
- Matroid_intersection type Combinatoric.
- Matroid_intersection comment "In combinatorial optimization, the matroid intersection problem is to find a largest common independent set in two matroids over the same ground set. If the elements of the matroid are assigned real weights, the weighted matroid intersection problem is to find a common independent set with the maximum possible weight.".
- Matroid_intersection label "Matroid intersection".
- Matroid_intersection sameAs Q6787903.
- Matroid_intersection sameAs m.065zcz6.
- Matroid_intersection sameAs Q6787903.
- Matroid_intersection wasDerivedFrom Matroid_intersection?oldid=683711143.
- Matroid_intersection isPrimaryTopicOf Matroid_intersection.