<--- Back to Details
First PageDocument Content
Algebraic topology / Topological spaces / Topological graph theory / Geometric group theory / Fundamental group / Homotopy / Contractible space / Shortest path problem / Out / Topology / Mathematics / Homotopy theory
Date: 2012-07-03 17:33:23
Algebraic topology
Topological spaces
Topological graph theory
Geometric group theory
Fundamental group
Homotopy
Contractible space
Shortest path problem
Out
Topology
Mathematics
Homotopy theory

Transforming Curves on Surfaces Redux Jeff Erickson∗ Kim Whittlesey University of Illinois, Urbana-Champaign†

Add to Reading List

Source URL: web.engr.illinois.edu

Download Document from Source Website

File Size: 1,55 MB

Share Document on Facebook

Similar Documents

EE365: Deterministic Finite State Control  Deterministic optimal control Shortest path problem Dynamic programming Examples

EE365: Deterministic Finite State Control Deterministic optimal control Shortest path problem Dynamic programming Examples

DocID: 1vg0M - View Document

We approach the problem of computing geometric centralities, such as closeness and harmonic centrality, on very large graphs; traditionally this task requires an all-pairs shortest-path computation in the exact case, or

We approach the problem of computing geometric centralities, such as closeness and harmonic centrality, on very large graphs; traditionally this task requires an all-pairs shortest-path computation in the exact case, or

DocID: 1sauD - View Document

We approach the problem of computing geometric centralities, such as closeness and harmonic centrality, on very large graphs; traditionally this task requires an all-pairs shortest-path computation in the exact case, or

We approach the problem of computing geometric centralities, such as closeness and harmonic centrality, on very large graphs; traditionally this task requires an all-pairs shortest-path computation in the exact case, or

DocID: 1rNo2 - View Document

Improving Restoration Success in Mesh Optical Networks Fang Yu 1, Rakesh Sinha2, Dongmei Wang3, Guangzhi Li3, John Strand2, Robert Doverspike2, Charles Kalmanek 3, and Bruce Cortez 2 1 EECS Department, UC Berkeley, Berke

Improving Restoration Success in Mesh Optical Networks Fang Yu 1, Rakesh Sinha2, Dongmei Wang3, Guangzhi Li3, John Strand2, Robert Doverspike2, Charles Kalmanek 3, and Bruce Cortez 2 1 EECS Department, UC Berkeley, Berke

DocID: 1rrH0 - View Document

CS261: A Second Course in Algorithms Lecture #2: Augmenting Path Algorithms for Maximum Flow∗ Tim Roughgarden† January 7, 2016

CS261: A Second Course in Algorithms Lecture #2: Augmenting Path Algorithms for Maximum Flow∗ Tim Roughgarden† January 7, 2016

DocID: 1rn0k - View Document