Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time

Martin Kutz
ACM Computing Research Repository, cs.CG/0512064

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!