Matroid minor

Results: 26



#Item
1Characterizing Graphs of Small Carving-Width R´emy Belmonte1? , Pim van ’t Hof1? , Marcin Kami´ nski3 , 2?? 4? ? ? Dani¨el Paulusma , and Dimitrios M. Thilikos

Characterizing Graphs of Small Carving-Width R´emy Belmonte1? , Pim van ’t Hof1? , Marcin Kami´ nski3 , 2?? 4? ? ? Dani¨el Paulusma , and Dimitrios M. Thilikos

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2012-05-06 07:54:01
2Mathematical Programming I. North-Holland Publishing Company  MATROIDS A N D THE G R E E D Y ALGORITHM * Jack EDMONDS National Bureau o f Standards, Washington, D.C., U.S.A.

Mathematical Programming I. North-Holland Publishing Company MATROIDS A N D THE G R E E D Y ALGORITHM * Jack EDMONDS National Bureau o f Standards, Washington, D.C., U.S.A.

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2014-11-28 11:05:21
3Sutra: International Journal of Mathematical Science Education, Technomathematics Research Foundation Vol. 1, No. 1, , 2008 CLASS-ROOM NOTES: OPTIMIZATION PROBLEM SOLVING - I

Sutra: International Journal of Mathematical Science Education, Technomathematics Research Foundation Vol. 1, No. 1, , 2008 CLASS-ROOM NOTES: OPTIMIZATION PROBLEM SOLVING - I

Add to Reading List

Source URL: www.tmrfindia.org

Language: English - Date: 2008-11-10 09:49:21
4A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids Jose´ A. Soto Department of Mathematics M.I.T.

A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids Jose´ A. Soto Department of Mathematics M.I.T.

Add to Reading List

Source URL: www.dim.uchile.cl

Language: English - Date: 2013-08-08 17:44:22
5Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein1 , Claire Mathieu2,3 , and Hang Zhou3 1 Brown  University, United States

Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein1 , Claire Mathieu2,3 , and Hang Zhou3 1 Brown University, United States

Add to Reading List

Source URL: www.normalesup.org

Language: English - Date: 2015-03-16 13:08:36
6Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids? Petr Hlinˇ en´ y School of Mathematical and Computing Sciences,

Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids? Petr Hlinˇ en´ y School of Mathematical and Computing Sciences,

Add to Reading List

Source URL: www.fi.muni.cz

Language: English - Date: 2005-07-07 11:28:02
7CCCG 2011, Toronto ON, August 10–12, 2011  Rigid components in fixed-lattice and cone frameworks∗ Matthew Berardi†  Brent Heeringa‡

CCCG 2011, Toronto ON, August 10–12, 2011 Rigid components in fixed-lattice and cone frameworks∗ Matthew Berardi† Brent Heeringa‡

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:14
8CCCG 2011, Toronto ON, August 10–12, 2011  Rigid components in fixed-lattice and cone frameworks∗ Matthew Berardi†  Brent Heeringa‡

CCCG 2011, Toronto ON, August 10–12, 2011 Rigid components in fixed-lattice and cone frameworks∗ Matthew Berardi† Brent Heeringa‡

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:14
9The maximum degree of planar graphs I. Series-parallel graphs Michael Drmota∗ Omer Gim´enez†

The maximum degree of planar graphs I. Series-parallel graphs Michael Drmota∗ Omer Gim´enez†

Add to Reading List

Source URL: www.dmg.tuwien.ac.at

Language: English - Date: 2010-04-09 02:13:52
10Streaming Lower Bounds for Approximating MAX-CUT Michael Kapralov∗ Sanjeev Khanna†  Madhu Sudan‡

Streaming Lower Bounds for Approximating MAX-CUT Michael Kapralov∗ Sanjeev Khanna† Madhu Sudan‡

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2014-12-09 10:13:51