Complexity of Testing Reachability in Matroids

First Page		Document Content
Date: 2014-07-14 14:10:19 Combinatorics Matroid Bicircular matroid Greedoid Pseudoforest Reachability Duality Graph St-connectivity Mathematics Matroid theory Graph theory		Complexity of Testing Reachability in Matroids Add to Reading List Source URL: cjtcs.cs.uchicago.edu Download Document from Source Website File Size: 387,36 KB Share Document on Facebook

	The Complexity of the Matroid-Greedoid Partition Problem Vera Asodi∗ and Christopher Umans† Abstract We show that the maximum matroid-greedoid partition problem is NP-hard to approximate DocID: 1qkDx - View Document
	PDF Document DocID: 1qbUT - View Document
	Sutra: International Journal of Mathematical Science Education, Technomathematics Research Foundation Vol. 1, No. 1, , 2008 CLASS-ROOM NOTES: OPTIMIZATION PROBLEM SOLVING - I DocID: 1pG70 - View Document
	A Class of Greedy Algorithms And Its Relation to Greedoids Srinivas Nedunuri Dept. of Computer S ien es University of Texas at Austin DocID: 1kbC4 - View Document
	Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids? Petr Hlinˇ en´ y School of Mathematical and Computing Sciences, DocID: 18WF4 - View Document