Interactive activity – Lines and bars graph www.webardora.net Activity where we can create a line or a bar graph and also perform several operations on the same data table, etc:

Source URL: www.webardora.net

Coordinate Geometry: Straight Lines & Circles Straight lines A. Some basic operations (i) Entering an equation in ‘GRAPH’ mode Example:

Source URL: www.casiomedia.co.uk

Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer

Source URL: disco.ethz.ch

• Computational complexity theory
• Complexity classes
• NP-complete problems
• Operations research
• Combinatorial optimization
• Mathematical optimization
• Knapsack problem
• Reduction
• Graph coloring
• NP-hardness
• NP
• Optimization problem

Vertex splitting and the recognition of trapezoid graphs

Source URL: community.dur.ac.uk

• Graph theory
• Graph operations
• Trapezoid graph
• Line graph
• Intersection graph
• Graph

g2o: A General Framework for Graph Optimization Rainer K¨ummerle Giorgio Grisetti Hauke Strasdat

Source URL: europa.informatik.uni-freiburg.de

• Mathematics
• Mathematical analysis
• Numerical analysis
• Numerical linear algebra
• Mathematical optimization
• Operations research
• Bundle adjustment
• Geodesy
• Surveying
• Gradient descent
• Preconditioner
• Cholesky decomposition

Spectral Graph Theory Lecture 14 The Simplest Construction of Expanders Daniel A. Spielman

Source URL: www.cs.yale.edu

• Graph theory
• Mathematics
• Algebra
• Algebraic graph theory
• Matrices
• Graph operations
• Expander graph
• Line graph
• Spectral graph theory
• Laplacian matrix
• Regular graph
• Zig-zag product

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

Source URL: rutcor.rutgers.edu

• Graph theory
• Graph coloring
• Graph operations
• Matroid theory
• Graph connectivity
• Pathwidth
• Graph minor
• Ear decomposition
• Treewidth
• Tree decomposition
• Edge contraction
• Branch-decomposition

TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Load-Dependent and Precedence-Based Models for Pickup and Delivery Problems

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

• Graph theory
• Operations research
• Mathematics
• Computational complexity theory
• Network flow
• NP-complete problems
• NP-hard problems
• Travelling salesman problem
• Multi-commodity flow problem
• Flow network

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

Source URL: www.math.uiuc.edu

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

Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n

Source URL: emarkou.users.uth.gr

• Graph theory
• Mathematics
• Computational complexity theory
• Operations research
• Combinatorial optimization
• Routing algorithms
• Search algorithms
• Edsger W. Dijkstra
• Travelling salesman problem
• A* search algorithm
• Flow network
• Tree traversal