UC Berkeley—CS 170: Efficient Algorithms and Intractable Problems Lecturer: David Wagner Handout 23 May 1, 2003

Source URL: www.cs.berkeley.edu

• NP-complete problems
• Complexity classes
• Bin packing problem
• NP
• Subset sum problem
• Partition problem
• Vertex cover
• Integer
• 3-partition problem
• Theoretical computer science
• Mathematics
• Computational complexity theory

inv lve a journal of mathematics Contributions to Seymour’s second neighborhood conjecture James Brantner, Greg Brockman, Bill Kay and Emma Snively

Source URL: www.gregbrockman.com

• Vertex
• Graph operations
• Graph theory
• Mathematics
• Graph

Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability Konstantin Makarychev IBM T.J. Watson Research Center Yury Makarychev

Source URL: konstantin.makarychev.net

• Ordinary differential equations
• Closed and exact differential forms
• Lemmas
• Differential geometry of surfaces
• Spectral theory of ordinary differential equations
• Calculus
• Mathematical analysis
• Mathematics

¨ GROBNER GEOMETRY OF VERTEX DECOMPOSITIONS AND OF FLAGGED TABLEAUX ALLEN KNUTSON, EZRA MILLER, AND ALEXANDER YONG A BSTRACT. We relate a classic algebro-geometric degeneration technique, dating

Source URL: www.math.duke.edu

• Geometric group theory
• Algebraic combinatorics
• Group theory
• Matrix theory
• Building
• Matrix
• Littelmann path model
• Algebra
• Abstract algebra
• Mathematics

Graphical Properties of Easily Localizable Sensor Networks Brian D O Anderson ∗

Source URL: www1.cs.columbia.edu

• Connectivity
• Vertex
• Degree
• Random graph
• Graph operations
• Pseudoforest
• Graph theory
• Graph
• Planar graph

inv lve a journal of mathematics Contributions to Seymour’s second neighborhood conjecture James Brantner, Greg Brockman, Bill Kay and Emma Snively

Source URL: gregbrockman.com

• Vertex
• Graph operations
• Graph theory
• Mathematics
• Graph

1 Grid Colorings in Steganography Jessica Fridrich and Petr Lisonˇek Abstract— A proper vertex coloring of a graph is called

Source URL: www.ws.binghamton.edu

• Theoretical computer science
• Computer arithmetic
• Discrete mathematics
• Hamming code
• Steganography
• Graph coloring
• Hamming
• Coding theory
• Mathematics
• Error detection and correction

My sources: • Norman Biggs, “Chip-firing and the critical group of a graph”, J. Alg. Combin), 25–45 • Discussions with Gregg Musiker The Chip-Firing Game • Start with a finite, simple, connected grap

Source URL: www.math.ku.edu

• Mathematics
• Group theory
• Quasigroup
• Constructible universe
• Vertex operator algebra
• Abstract algebra
• Algebra
• Nonassociative algebra

Cut-primed smart copying Alexander Neubeck, Alexey Zalesny and Luc van Gool Swiss Federal Institute of Technology Zurich, Switzerland Email: {aneubeck,zalesny,vangool}@vision.ee.ethz.ch Abstract— Texture synthesis thro

Source URL: www.macs.hw.ac.uk

• Symmetry
• Texture mapping
• Tessellation
• Vertex
• Visual arts
• Optics
• Aesthetics
• 3D computer graphics
• Texture synthesis
• Computer graphics

Herschel enneahedron net by Christian Perfect This is the smallest non-Hamiltonian polyhedron – you can’t draw a path starting and ending at the same vertex which visits each vertex exactly once. It’s also the only

Source URL: aperiodical.com