Intelligent Graph Layout Using Many Users’ Input Xiaoru Yuan, Member, IEEE, Limei Che, Yifan Hu and Xin Zhang Fig. 1. Two layouts that combine many users’ input sub-graphs using our Laplacian Constrained Distance Emb

Source URL: yifanhu.net

Pursuit evasion on infinite graphs Florian Lehner∗ January 11, 2016 The cop-and-robber game is a game between two players, where one tries to catch the other by moving along the edges of a graph. It is well known

Source URL: www.florian-lehner.net

SHORTEST PATHS IN THE TOWER OF HANOI GRAPH AND FINITE AUTOMATA DAN ROMIK Abstract. We present efficient algorithms for constructing a shortest path between two configurations in the Tower of Hanoi graph, and for computin

Source URL: www.math.ucdavis.edu

GLOBAL STRUCTURAL PROPERTIES OF RANDOM GRAPHS JASON BEHRSTOCK, VICTOR FALGAS-RAVRY, MARK F. HAGEN, AND TIM SUSSE Abstract. We study two global structural properties of a graph Γ, denoted AS and CFS, which arise in a nat

Source URL: www.wescac.net

Algorithms and Data Structures Winter TermExercises for UnitConsider a bipartite graph G = (A ∪ B, E). • Let M1 and M2 be two matchings in G. Show that there is always a matching that

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

TOPOLOGICAL PRINCIPLES IN CARTOGRAPHY James P. Corbett ABSTRACT CHARACTER OF A MAP A map may be described as a linear graph embedded in a orientable, two-dimen sional manifold. A manifold, aside from being a two-dimensio

Source URL: mapcontext.com

Chi-Han Peng & Peter Wonka / Connectivity Editing for Quad-Dominant Meshes Additional Materials Figure 17: The two possible outcomes (depending on the pvertex/d-vertex labeling) in the primal domain √ by applying a

Source URL: peterwonka.net

• Polyhedra
• Polytopes
• Geometry
• Dual polyhedron
• Planar graph
• Mathematics
• 3D computer graphics
• Discrete mathematics
• Mesh generation

Bachelor / Master Thesis Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note that

Source URL: page.math.tu-berlin.de

• Graph theory
• Kneser graph
• Petersen graph
• Odd graph
• Hamiltonian path
• Graph
• Cycle
• Planar graphs
• Desargues graph
• Polyhedral graph

In this talk, I will discuss Ligra, a shared-memory graph processing framework that has two very simple routines, one for mapping over edges and one for mapping over vertices. The routines can be applied to any subset of

Source URL: mmds-data.org

Algorithms and Data Structures Winter TermExercises for Units 25 & 26 1. Suppose you are given a directed graph G = (V, E), two vertices s and t, a capacity function c : E → R+ , and another function f : E →

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

• Graph theory
• Mathematics
• Network flow
• Graph connectivity
• Combinatorial optimization
• Maximum flow problem
• Cut
• Flow network
• Max-flow min-cut theorem
• Minimum-cost flow problem