Map matching - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2014-06-26 02:33:00 Graph theory Mathematics Discrete mathematics NP-complete problems Matching Graph connectivity Geometric group theory Train track map Minimum-cost flow problem		Add to Reading List Source URL: www-cc.cs.uni-saarland.de Download Document from Source Website File Size: 119,77 KB Share Document on Facebook

	PDF Document DocID: 1qFtA - View Document
	CUBULATING HYPERBOLIC FREE-BY-CYCLIC GROUPS: THE GENERAL CASE MARK F. HAGEN AND DANIEL T. WISE Abstract. Let Φ ∶ F → F be an automorphism of the finite-rank free group F . Suppose that G = F ⋊Φ Z is word-hyperbol DocID: 1ptco - View Document
	Cubulating hyperbolic free-by-Z groups Mark Hagen Department of Mathematics University of Michigan Karcher Lecture, 26 February 2014 DocID: 1oXp2 - View Document
	CUBULATING HYPERBOLIC FREE-BY-CYCLIC GROUPS: THE IRREDUCIBLE CASE MARK F. HAGEN AND DANIEL T. WISE Abstract. Let V be a nite graph and let φ : V → V be an irreducible train track map whose mapping torus has word-hype DocID: 1oUHZ - View Document
	COMPUTING THE PARTITION FUNCTION FOR GRAPH HOMOMORPHISMS WITH MULTIPLICITIES ´n Alexander Barvinok and Pablo Sobero July 2015 DocID: 1nncn - View Document