Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Matroid_partitioning> ?p ?o }
Showing triples 1 to 46 of
46
with 100 triples per page.
- Matroid_partitioning abstract "The matroid partitioning problem is a problem arising in the mathematical study of matroids and in the design and analysis of algorithms, in which the goal is to partition the elements of a matroid into as few independent sets as possible. An example is the problem of computing the arboricity of an undirected graph, the minimum number of forests needed to cover all of its edges. Matroid partitioning may be solved in polynomial time, given an independence oracle for the matroid. It may be generalized to show that a matroid sum is itself a matroid, to provide an algorithm for computing ranks and independent sets in matroid sums, and to compute the largest common independent set in the intersection of two given matroids.".
- Matroid_partitioning thumbnail K44_arboricity.svg?width=300.
- Matroid_partitioning wikiPageID "36950801".
- Matroid_partitioning wikiPageLength "11800".
- Matroid_partitioning wikiPageOutDegree "31".
- Matroid_partitioning wikiPageRevisionID "675336647".
- Matroid_partitioning wikiPageWikiLink Algorithm.
- Matroid_partitioning wikiPageWikiLink Arboricity.
- Matroid_partitioning wikiPageWikiLink Category:Matroid_theory.
- Matroid_partitioning wikiPageWikiLink Crispin_Nash-Williams.
- Matroid_partitioning wikiPageWikiLink Degree_(graph_theory).
- Matroid_partitioning wikiPageWikiLink Directed_graph.
- Matroid_partitioning wikiPageWikiLink Graph_(discrete_mathematics).
- Matroid_partitioning wikiPageWikiLink Graph_toughness.
- Matroid_partitioning wikiPageWikiLink Graphic_matroid.
- Matroid_partitioning wikiPageWikiLink Matroid.
- Matroid_partitioning wikiPageWikiLink Matroid_intersection.
- Matroid_partitioning wikiPageWikiLink Matroid_minor.
- Matroid_partitioning wikiPageWikiLink Matroid_oracle.
- Matroid_partitioning wikiPageWikiLink Matroid_rank.
- Matroid_partitioning wikiPageWikiLink Matroid_sum.
- Matroid_partitioning wikiPageWikiLink Path_(graph_theory).
- Matroid_partitioning wikiPageWikiLink Pigeonhole_principle.
- Matroid_partitioning wikiPageWikiLink Reachability.
- Matroid_partitioning wikiPageWikiLink Set_cover_problem.
- Matroid_partitioning wikiPageWikiLink Set_packing.
- Matroid_partitioning wikiPageWikiLink Spanning_tree.
- Matroid_partitioning wikiPageWikiLink Time_complexity.
- Matroid_partitioning wikiPageWikiLink Tree_(graph_theory).
- Matroid_partitioning wikiPageWikiLink File:K44_arboricity.svg.
- Matroid_partitioning wikiPageWikiLinkText "Matroid partitioning".
- Matroid_partitioning wikiPageWikiLinkText "matroid partitioning".
- Matroid_partitioning wikiPageUsesTemplate Template:Harvtxt.
- Matroid_partitioning wikiPageUsesTemplate Template:Reflist.
- Matroid_partitioning subject Category:Matroid_theory.
- Matroid_partitioning hypernym Problem.
- Matroid_partitioning type Disease.
- Matroid_partitioning type Combinatoric.
- Matroid_partitioning comment "The matroid partitioning problem is a problem arising in the mathematical study of matroids and in the design and analysis of algorithms, in which the goal is to partition the elements of a matroid into as few independent sets as possible. An example is the problem of computing the arboricity of an undirected graph, the minimum number of forests needed to cover all of its edges. Matroid partitioning may be solved in polynomial time, given an independence oracle for the matroid.".
- Matroid_partitioning label "Matroid partitioning".
- Matroid_partitioning sameAs Q6787906.
- Matroid_partitioning sameAs m.0m085cb.
- Matroid_partitioning sameAs Q6787906.
- Matroid_partitioning wasDerivedFrom Matroid_partitioning?oldid=675336647.
- Matroid_partitioning depiction K44_arboricity.svg.
- Matroid_partitioning isPrimaryTopicOf Matroid_partitioning.