Matroid theory

Results: 338



#Item
1Sage Reference Manual: Matroid Theory Release 8.3 The Sage Development Team

Sage Reference Manual: Matroid Theory Release 8.3 The Sage Development Team

Add to Reading List

Source URL: doc.sagemath.org

Language: English - Date: 2018-08-04 05:57:44
2Characterizing 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
3ANALYTIC ZARISKI STRUCTURES AND NON-ELEMENTARY CATEGORICITY BORIS ZILBER Abstract. We study analytic Zariski structures from the point of view of non-elementary model theory. We show how to associate an abstract elementa

ANALYTIC ZARISKI STRUCTURES AND NON-ELEMENTARY CATEGORICITY BORIS ZILBER Abstract. We study analytic Zariski structures from the point of view of non-elementary model theory. We show how to associate an abstract elementa

Add to Reading List

Source URL: people.maths.ox.ac.uk

Language: English - Date: 2016-01-12 10:43:42
4Bonn Workshop on Combinatorial Optimization Wednesday, November 5th, 2008 Chair: Minyi Yue 09.00 – 09.30

Bonn Workshop on Combinatorial Optimization Wednesday, November 5th, 2008 Chair: Minyi Yue 09.00 – 09.30

Add to Reading List

Source URL: www.or.uni-bonn.de

Language: English - Date: 2008-11-04 22:42:02
5Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains Isabelle Stanton∗ Ali Pinar† UC Berkeley Sandia National Laboratories‡

Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains Isabelle Stanton∗ Ali Pinar† UC Berkeley Sandia National Laboratories‡

Add to Reading List

Source URL: www.sandia.gov

Language: English - Date: 2011-01-04 15:53:31
6Finding Common Structured Patterns in Linear Graphs ? Guillaume Fertin LINA, CNRS UMR 6241, Universit´e de Nantes, 2 rue de la Houssini`ere, 44322 Nantes, France

Finding Common Structured Patterns in Linear Graphs ? Guillaume Fertin LINA, CNRS UMR 6241, Universit´e de Nantes, 2 rue de la Houssini`ere, 44322 Nantes, France

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2011-04-27 05:27:10
7583  Documenta Math. A Common Recursion For Laplacians of Matroids and Shifted Simplicial Complexes

583 Documenta Math. A Common Recursion For Laplacians of Matroids and Shifted Simplicial Complexes

Add to Reading List

Source URL: documenta.sagemath.org

Language: English - Date: 2005-12-23 13:25:06
8On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman, Ondˇrej Pangr´ac Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostransk´e n´

On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman, Ondˇrej Pangr´ac Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostransk´e n´

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2009-04-29 03:46:21
9143  Documenta Math. The Coming of the Matroids William H. Cunningham

143 Documenta Math. The Coming of the Matroids William H. Cunningham

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2012-07-25 10:24:53
10Concept Graphs without Negations: Standardmodels and Standardgraphs Frithjof Dau Technische Universit¨ at Darmstadt, Fachbereich Mathematik Schloßgartenstr. 7, DDarmstadt,

Concept Graphs without Negations: Standardmodels and Standardgraphs Frithjof Dau Technische Universit¨ at Darmstadt, Fachbereich Mathematik Schloßgartenstr. 7, DDarmstadt,

Add to Reading List

Source URL: www.dr-dau.net

Language: English - Date: 2007-08-09 21:04:38