Upper School Math Supply List #2 Pencils 3 ring binder – 1 1/2” Graph paper Loose-leaf paper Book Sock

Source URL: www.spsprinceton.org

Historical index structure for reducing insertion and search cost in LBS

Source URL: silvianittel.files.wordpress.com

• Binary trees
• B-tree
• Graph theory
• Learning
• Computer programming
• R-tree
• B+ tree
• Rope
• T-tree
• Trie
• Fractal tree index
• Hilbert R-tree

Ultra-Fast Rumor Spreading in Social Networks

Source URL: web.mat.bham.ac.uk

• Mathematics
• Graph theory
• Discrete mathematics
• Second moment method
• Graph
• Maximal independent set
• Draft:Sub-linear time algorithm

New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ † Archontia C. Giannopoulou‡ §

Source URL: community.dur.ac.uk

• Graph theory
• NP-complete problems
• Ear decomposition
• Matroid theory
• Graph
• Dominating set
• Chordal graph
• Graph coloring
• Line graph
• Expander graph

155 Documenta Math. On the History of the Shortest Path Problem Alexander Schrijver

Source URL: documenta.sagemath.org

• Mathematics
• Graph theory
• Discrete mathematics
• Edsger W. Dijkstra
• Routing algorithms
• Operations research
• Network theory
• Shortest path problem
• Dynamic programming
• Distance
• Path
• Linear programming

Connections The Operating Room: It’s a Small World (and Scale Free Network) After All Patrick J. Tighe University of Florida College of Medicine Gainesville, Florida

Source URL: nersp.nerdc.ufl.edu

• Medicine
• Health care
• Health
• Graph theory
• Anesthesia
• Network theory
• Medical specialties
• Surgery
• Anesthesiologist
• Anesthesiology
• Betweenness centrality
• Social network analysis

Noname manuscript No. (will be inserted by the editor) A portable parallel implementation of the lrs vertex enumeration code David Avis and Gary Roumanis

Source URL: cgm.cs.mcgill.ca

• Computer programming
• Mathematics
• Software engineering
• Graph connectivity
• Connectivity
• Tree traversal
• Search algorithms
• NP-complete problems
• Biconnected component
• HopcroftKarp algorithm

Robustness of Markov processes on large networks R.S.MacKay Mathematics Institute and Centre for Complexity Science, University of Warwick, Coventry CV4 7AL, UK

Source URL: www2.warwick.ac.uk

• Mathematical analysis
• Mathematics
• Probability theory
• Markov processes
• Stochastic processes
• Graph theory
• Markov chain
• Spectral theory
• Ising model
• Mixing
• Decomposition of spectrum
• Spectral theory of ordinary differential equations

METRICALLY HOMOGENEOUS GRAPHS OF DIAMETER THREE DANIELA AMATO, GREGORY CHERLIN, AND H. DUGALD MACPHERSON Abstract. We classify countable metrically homogeneous graphs of diameter 3.

Source URL: www1.maths.leeds.ac.uk

• Graph theory
• Graph
• Henson graph
• Complete graph
• Star
• Homogeneous graph
• Graph coloring
• Algebraic graph theory

Algorithms and Data Structures Winter TermExercises for UnitIn a basketball tournament n teams play against each other (possibly multiple times) in a pre-determined sequence. The winner of a game gets one

Source URL: www-tcs.cs.uni-sb.de

• Graph theory
• Mathematics
• Network flow
• Graph connectivity
• Combinatorial optimization
• Routing algorithms
• Matching
• FordFulkerson algorithm
• Maximum flow problem
• Flow network
• Cut
• Graph