CCCG 2010, Winnipeg MB, August 9–11, 2010 Hausdorff Core of a One Reflex Vertex Polygon Robert Fraser∗ Abstract

Source URL: www.cs.umanitoba.ca

Vertex Numbers of Weighted Faces in Poisson Hyperplane Mosaics Rolf Schneider Mathematisches Institut, Albert-Ludwigs-Universit¨at, DFreiburg i. Br., Germany

Source URL: home.mathematik.uni-freiburg.de

Tight Integrality Gaps for Lovasz-Schrijver LP Relaxations of Vertex Cover and Max Cut Grant Schoenebeck∗ Luca Trevisan†

Source URL: ttic.uchicago.edu

Algorithms for Single-Source Vertex Connectivity Julia Chuzhoy Toyota Technological Institute Chicago, IL 60637

Source URL: ttic.uchicago.edu

Algorithms for Single-Source Vertex Connectivity Sanjeev Khanna∗ University of Pennsylvania Philadelphia PA 19103

Source URL: ttic.uchicago.edu

2012 IEEE Conference on High Performance Extreme Computing

Source URL: www.cc.gatech.edu

• Graph theory
• Graph operations
• Line graph
• Graph
• Cray
• Vertex
• Connectivity
• Topological graph theory
• Adjacency list
• Directed acyclic graph

A New Perspective on Vertex Connectivity Keren Censor-Hillel Mohsen Ghaffari Fabian Kuhn

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

Photo or figure (optional)

Source URL: www.strc.ch

• Graph theory
• Mathematics
• Discrete mathematics
• Graph
• Directed graph
• Matching
• Degree
• Vertex
• Ear decomposition
• Tree
• Line graph
• Bipartite graph

Accelerating Irregular Computations with Hardware Transactional Memory and Active Messages Maciej Besta Torsten Hoefler

Source URL: htor.inf.ethz.ch

• Graph theory
• Mathematics
• Computing
• Concurrency control
• Transaction processing
• NP-complete problems
• Computer memory
• Transactional memory
• Vertex
• Breadth-first search
• Graph coloring
• Transactional Synchronization Extensions

Hamiltonian Cycles in Sparse Vertex-Adjacency Duals Perouz Taslakian and Godfried Toussaint School of Computer Science McGill University Montr´eal, Qu´ebec, Canada {perouz, godfried}@cs.mcgill.ca

Source URL: homepages.ulb.ac.be