Efficient Shortest Paths on Massive Social Graphs Xiaohan Zhao, Alessandra Sala, Haitao Zheng and Ben Y. Zhao Department of Computer Science, U. C. Santa Barbara, Santa Barbara, USA {xiaohanzhao, alessandra, htzheng, rav

Source URL: www.cs.ucsb.edu

• Graph theory
• Mathematics
• Discrete mathematics
• Network theory
• Edsger W. Dijkstra
• Network analysis
• Routing algorithms
• Centrality
• Shortest path problem
• Planar graph
• Pathfinding
• Social network analysis

Planar crossing numbers of graphs embeddable in another surface K´aroly J. B¨or¨oczky∗, J´anos Pach† and G´eza T´oth‡ R´enyi Institute, Hungarian Academy of Sciences Abstract

Source URL: www.renyi.hu

Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond Klaus-Tycho F¨ orster, Rijad Nuridini, Jara Uitto, and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerlan

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Pursuit-evasion
• Planar graph
• Matching
• Graph
• Neighbourhood
• Graph coloring
• Entanglement
• Graph operations
• Tree-depth

Microsoft Word - IshaqueZaidiLevis-SEdoc

Source URL: www.eecs.tufts.edu

• Network theory
• Operations research
• Project management
• Graph theory
• Critical path method
• Management
• Graph
• Program evaluation and review technique
• Vertex
• Planar graph

NetworkX Tutorial Release 1.9 Aric Hagberg, Dan Schult, Pieter Swart June 21, 2014

Source URL: networkx.github.io

• Graph theory
• Graph
• DOT
• Multigraph
• Planar graph
• Line graph

LOOP MODELS, RANDOM MATRICES AND PLANAR ALGEBRAS A. GUIONNET, V. F. R. JONES, D. SHLYAKHTENKO, AND P. ZINN-JUSTIN Abstract. We define matrix models that converge to the generating functions of a wide variety of loop mode

Source URL: www.umpa.ens-lyon.fr

Microsoft Word - Planar_1.4_85_ZF.doc

Source URL: www.zeiss.co.nz

C:/Documents and Settings/mishaq01/Desktop/Mashhood/Conference Papers/COCOON 2009/camera ready/cocoon101a.dvi

Source URL: www.eecs.tufts.edu

• Graph theory
• Mathematics
• Graph operations
• Polygons
• Planar graphs
• Graph connectivity
• Dual graph
• Edge
• Graph
• Vertex
• Ear decomposition
• Bridge

A Simple Algorithm for Computing a Spiral Polygonization of a Finite Planar Set M. Ahsan, S. Cheruvatur, M. Gamboni, A. Garg, O. Grishin, S. Hashimoto, J. Jermsurawong, G. T. Toussaint, and L. Zhang Faculty of Science, N

Source URL: fwcg14.cse.uconn.edu

Coloring Copoints of a Planar Point Set Walter Morris Department of Mathematical Sciences George Mason University 4400 University Drive, Fairfax, VA 22030, USA

Source URL: math.gmu.edu