meatball's library 22 articles Export

	Efficient algorithms for finding maximum matching in graphs [My Copy] ACM Comput. Surv., Vol. 18, No. 1. (March 1986), pp. 23-38. by Zvi Galil posted to no-tag by meatball on 2006-11-20 17:56:38 as along with 1 person JoeVinegar
	Finding All the Perfect Matchings in Bipartite Graphs [My Copy] AMLETS: Applied Mathematics Letters, Vol. 7 (1994) by Fukuda, Matsui posted to no-tag by meatball on 2006-11-17 22:39:27 as
	A theory of alternating paths and blossoms for proving correctness of the general graph maximum matching algorithm [My Copy] Combinatorica, Vol. V14, No. 1. (1 March 1994), pp. 71-109. by Vijay V. Vazirani posted to no-tag by meatball on 2006-11-17 21:50:36 as
	Zero-One Permanent is #P-Complete, A Simpler Proof [My Copy] by Amir B. Dor, Shai Halevi posted to no-tag by meatball on 2006-11-16 19:26:11 as
	The complexity of computing the permanent [My Copy] Theoretical Computer Science, Vol. 8, No. 2. (1979), pp. 189-201. by L. G. Valiant posted to no-tag by meatball on 2006-11-16 18:57:33 as
	A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries [My Copy] J. ACM, Vol. 51, No. 4. (July 2004), pp. 671-697. by Mark Jerrum, Alistair Sinclair, Eric Vigoda posted to no-tag by meatball on 2006-11-16 18:25:39 as along with 2 people citeUlike123 tanyabw
	Network Flows: Theory, Algorithms, and Applications [My Copy] (18 February 1993) by Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin posted to no-tag by meatball on 2006-11-15 19:22:20 as along with 8 people and 1 group rocarvaj cradle25 AbnerCYH ahmadsuyuti nkorf NeilInCanadia gtdj djlin Semantic-Social-Networks
	Maximum matchings in sparse random graphs: Karp-Sipser revisited [My Copy] Random Structures and Algorithms, Vol. 12, No. 2. (1998), pp. 111-177. by Jonathan Aronson, Alan M. Frieze, Boris Pittel posted to no-tag by meatball on 2006-11-15 13:35:34 as
	Compiler optimization on VLIW instruction scheduling for low power [My Copy] ACM Trans. Des. Autom. Electron. Syst., Vol. 8, No. 2. (April 2003), pp. 252-268. by Chingren Lee, Jenq K. Lee, Tingting Hwang, Shi-Chun Tsai posted to no-tag by meatball on 2006-11-13 18:21:22 as
	Linear reductions of maximum matching [My Copy] In SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001), pp. 825-826. by Therese Biedl posted to no-tag by meatball on 2006-11-13 14:32:48 as
	The time complexity of maximum matching by simulated annealing [My Copy] J. ACM, Vol. 35, No. 2. (April 1988), pp. 387-403. by Galen H. Sasaki, Bruce Hajek posted to no-tag by meatball on 2006-11-13 14:19:43 as
	Introduction to Algorithms [My Copy] (10 August 2001) by Thomas H. Cormen, Clifford Stein, Charles E. Leiserson, Robert L. Rivest posted to no-tag by meatball on 2006-11-13 13:57:56 as along with 11 people and 4 groups BelliOS pdlug ana pmatos sunniesheu fsilvestri stagediver sdvillal caomo spinaltap526 mpotamias structural_bioinformatics InformationRetrieval Bioinformatics AI
	Algorithms and codes for the assignment problem [My Copy] Annals of Operations Research, Vol. V13, No. 1. (27 December 1988), pp. 191-223. by Giorgio Carpaneto, Silvano Martello, Paolo Toth posted to no-tag by meatball on 2006-11-12 12:40:13 as
	A theoretician's guide to the experimental analysis of algorithms [My Copy] (1996) by D. Johnson posted to no-tag by meatball on 2006-11-11 15:42:46 as along with 9 people and 1 group ansobol DineshGaitonde jrw imouthesmp rahul BarrosH wnpx estrabd eswar_physics SRL
	An Introduction to the Bootstrap [My Copy] (15 May 1994) by Bradley Efron, Robert J. Tibshirani posted to no-tag by meatball on 2006-11-11 15:40:22 as along with 16 people and 2 groups allmensch napvasconcelos frohike gyuli sdvillal pbellec ctacmo jclau bedo dejang skrofej polykrates naegele shimazaki ecome sfcheung Statistics_and_Social_Science Biostatistics
	König's edge coloring theorem without augmenting paths [My Copy] Journal of Graph Theory, Vol. 29, No. 2. (1998), 87. by Romeo Rizzi posted to no-tag by meatball on 2006-11-09 16:00:12 as
	Edge-Coloring Bipartite Graphs [My Copy] Journal of Algorithms, Vol. 34, No. 2. (February 2000), pp. 390-396. by Ajai Kapoor, Romeo Rizzi posted to no-tag by meatball on 2006-11-09 15:58:23 as
	Using euler partitions to edge color bipartite multigraphs [My Copy] International Journal of Parallel Programming, Vol. V5, No. 4. (1 December 1976), pp. 345-355. by Harold N. Gabow posted to no-tag by meatball on 2006-11-09 14:55:16 as
	A matching algorithm for regular bipartite graphs [My Copy] Discrete Applied Mathematics, Vol. 35, No. 3. (6 March 1992), pp. 197-203. by J. Csima, L. Lovasz posted to no-tag by meatball on 2006-11-09 14:42:24 as
	A simple matching algorithm for regular bipartite graphs [My Copy] Information Processing Letters, Vol. 84, No. 4. (30 November 2002), pp. 189-193. by Kazuhisa Makino, Takashi Takabatake, Satoru Fujishige posted to no-tag by meatball on 2006-11-09 14:38:33 as
	Bipartite edge-colouring in O(Δm) time [My Copy] by Alexander Schrijver posted to no-tag by meatball on 2006-11-09 13:37:58 as
	Edge-coloring bipartite multigraphs in O(E log D) time [My Copy] (2001) by R. Cole, K. Ost, S. Schirra posted to no-tag by meatball on 2006-11-09 13:22:27 as

Note: You may cite this page as: http://www.citeulike.org/user/meatball

meatball's library 22 articles Export

meatball's tags