Fast algorithms for surface embedded graphs via homology

Made available in DSpace on 2014-01-16T17:54:48Z (GMT). No. of bitstreams: 3 Kyle_Fox.pdf: 3026914 bytes, checksum: c71a059d2688d88bc4678429df958563 (MD5) dissertation.zip: 35243792 bytes, checksum: 5c50fb8cf2afd614d071c635e5821a34 (MD5) license.txt: 4058 bytes, checksum: c32d63ce5558ff1bbaeb3116283f6fc6 (MD5)

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2014

Author dc:creator

• Fox, Kyle J.

Contributors dc:contributor

• Erickson, Jeff G.
• Chekuri, Chandra S.
• Hoiem, Derek W.
• Eppstein, David

• computational topology
• topological graph theory
• Homology
• minimum cut
• maximum flow
• non-trivial cycles

Statement dc:rights

• Copyright 2013 Kyle J. Fox

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/46579

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/46579