Connectivity and Design of Planar Global Attractors of Sturm Type. I: Bipolar Orientations and Hamiltonian Paths Bernold Fiedler Institut f¨ ur Mathematik

Source URL: dynamics.mi.fu-berlin.de

Microsoft PowerPoint - DIALMPOMC03.ppt

Source URL: disco.ethz.ch

• Graph theory
• NP-complete problems
• Wireless networking
• Unit disk graph
• Routing algorithms
• Wireless ad hoc network
• Routing
• Topology control
• Topological graph theory
• Planar graph
• Geographic routing
• Graph coloring

UNTANGLING PLANAR GRAPHS FROM A SPECIFIED VERTEX POSITION — HARD CASES M. KANG, O. PIKHURKO∗, A. RAVSKY, M. SCHACHT, AND O. VERBITSKY † Abstract. Given a planar graph G, we consider drawings of G in the plane where

Source URL: homepages.warwick.ac.uk

Approximation algorithms for mixed, windy, and capacitated arc routing problems René van Bevern1 , Christian Komusiewicz2 , and Manuel Sorge2 1 2

Source URL: fpt.akt.tu-berlin.de

• Dynamic programming
• Routing algorithms
• Eulerian path
• Shortest path problem
• FloydWarshall algorithm
• NP-complete problems
• Planar separator theorem
• Dominating set

Double proximity effect in hybrid planar Superconductor(Normal metal/Ferromagnet)-Superconductor structures S N δ~ETh=ħD/dn2 F

Source URL: meso12.itp.ac.ru

Lehrstuhl Schiffbau Prof. Dr.-Ing. Robert Bronsart Erzeugung ebener Schnitte mit einer verallgemeinerten B-Splinefl¨ache. Generation of planar cross sections of a generalized B-spline surface.

Source URL: www.lsb.uni-rostock.de

Optimized Planar Penning Traps for Quantum Information Studies J. Goldman and G. Gabrielse∗ A one-electron qubit would offer a new option for quantum information science, including the possibility of extremely long coh

Source URL: gabrielse.physics.harvard.edu

Packing and Covering Triangles in K4-free Planar Graphs∗ Penny Haxell† Alexandr Kostochka

Source URL: perso.ens-lyon.fr

Race Detection in Two Dimensions Dimitar Dimitrov Martin Vechev Vivek Sarkar

Source URL: www.srl.inf.ethz.ch

• Graph theory
• Planar graphs
• Graph connectivity
• Series-parallel graph
• Graph
• Reachability
• Lattice graph
• Topological sorting
• Trapezoid graph

Two critical periods in the evolution of random planar graphs Mihyun Kang Institut f¨ur Mathematik, MA 6-2, Technische Universit¨at Berlin Straße des 17. Juni 136, 10623 Berlin, Germany

Source URL: www.math.tugraz.at