Hi Chao, The state of the art in 3-connectivity algorithms is a 1979 book chapter by Bixby and Cunningham, see http://www.ams.org/mathscinet-getitem?mr=538038 (you'll have to dig it up from a library, most likely). For matroid union and intersection, Schrijver's 3-volume Combinatorial Optimization is a good reference.
How much do you know about matroids? Cheers, Stefan van Zwam. On Tuesday, March 3, 2015 at 2:39:49 PM UTC-6, Chao Xu wrote: > > Hi all! > > I'm Chao Xu, a computer science PhD student at UIUC. > - I had experience with Sage a few years ago during an REU, and I > sometimes dub in python. > - I have lot of experience implementing algorithms(although it's in Java). > - I'm interested in combinatorial optimization, and believe implementing > some algorithms for matroid seems to be a good introduction to this field. > > Any papers could bring me up to speed with the current state of art? So I > might get a feeling of what is feasible. > > Best, > Chao > -- You received this message because you are subscribed to the Google Groups "sage-gsoc" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-gsoc. For more options, visit https://groups.google.com/d/optout.
