How to Grow More Pairs: Suggesting Review Targets For Comparison-Friendly Review Ecosystems James Cook ∗ UC Berkeley

Source URL: www2013.wwwconference.org

• Mathematics
• NP-complete problems
• Combinatorics
• Discrete mathematics
• Greedy algorithm
• Matroid theory
• Set cover problem
• Algorithm
• Combinatorial optimization

Formal Verification of Coalescing Graph-Coloring Register Allocation Sandrine Blazy1 , Benoˆıt Robillard2 , and Andrew W. Appel3 1 IRISA - Universit´e Rennes 1

Source URL: www.cs.princeton.edu

• Graph theory
• Graph coloring
• Matroid theory
• Register allocation
• Graph
• Degree
• Ear decomposition
• Edge contraction
• Line graph

RIGIDITY OF FRAMEWORKS IN 3D KERAN HUANG, JONATHAN MCGREAL, NACHIKET JOSHI Our studies during Fall 2013 in the Illinois Geometry Lab (IGL) concerned the rigidity of 3 dimensional rod-and-pinion frameworks. A framework is

Source URL: www.math.illinois.edu

• Mechanics
• Physics
• Mechanical engineering
• Rigid bodies
• Rotational symmetry
• Structural rigidity
• Degrees of freedom
• Shape
• Dental braces
• Graph theory
• Rigidity matroid

reg4-n50-c512M-b1M.time.ps

Source URL: homepages.ecs.vuw.ac.nz

• Graph theory
• Graph coloring
• Matroid theory
• Polynomials
• Tutte polynomial
• Chromatic polynomial
• Matching
• Ear decomposition
• Spanning tree
• Graph
• Degree
• Connected component

Tyler Moss* (). Matroids that are extremal with respect to Bixby’s Lemma. Bixby’s Lemma is a well-known result in matroid theory that guarantees that any element in a 3-connected mat

Source URL: jointmathematicsmeetings.org

A Class of Greedy Algorithms And Its Relation to Greedoids Srinivas Nedunuri Dept. of Computer S ien es University of Texas at Austin

Source URL: www.kestrel.edu

• Mathematics
• Combinatorial optimization
• Greedoid
• Order theory
• Matroid
• Category theory
• Universal property
• Morphism

Jesse Taylor* (). On matroid minors that guarantee their duals as minors. A fundamental operation for matroids is the construction of the dual. This talk solves the problem of determi

Source URL: jointmathematicsmeetings.org

Matroid Basics Saket Saurabh The Institute of Mathematical Sciences, India and University of Bergen, Norway. FPT School, Polland, August 18–22, 2014

Source URL: fptschool.mimuw.edu.pl

PDF Document

Source URL: homepages.ecs.vuw.ac.nz

• Graph theory
• Graph coloring
• Polynomials
• Matroid theory
• Tutte polynomial
• Chromatic polynomial
• Petersen graph
• Matroid
• Ear decomposition
• Spanning tree
• Line graph
• Graph

Discrete Methods in Informatics November 7, 2005 Lecture 4 (Matroid) Lecturer: Satoru Iwata

Source URL: www.opt.mist.i.u-tokyo.ac.jp