Rooted pointwise limit of graphs Papergives an asymptotic characterization of connected finite vertextransitive graphs of bounded (orientable or non-orientable) genus. All but a finite number of such graphs are em

First Page		Document Content
Date: 2014-04-12 04:53:59 Graph theory Algebraic graph theory Vertex-transitive graph Hadwiger number Graph minor Graph End Symmetric graph Planar graph		Rooted pointwise limit of graphs Papergives an asymptotic characterization of connected finite vertextransitive graphs of bounded (orientable or non-orientable) genus. All but a finite number of such graphs are em Add to Reading List Source URL: people.cs.uchicago.edu Download Document from Source Website File Size: 48,01 KB Share Document on Facebook

	Near-Optimal Compression for the Planar Graph Metric Amir Abboud∗ Paweł Gawrychowski† Abstract DocID: 1vkO7 - View Document
	Computing the Girth of a Planar Graph in O(n log n) time Oren Weimann (Weizmann Institute of Science) Raphy Yuster (University of Haifa) DocID: 1v2rQ - View Document
	UNDER REVIEW, Gracker: A Graph-based Planar Object Tracker Tao Wang and Haibin Ling DocID: 1uoNh - View Document
	The random planar graph process Stefanie Gerke ∗ Dirk Schlatter DocID: 1tk3p - View Document
	Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved DocID: 1rtvU - View Document