http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
linear time algorithm for isomorphism of graphs of bounded average genus
Abstract: "A structure theorem is proved for the class of graphs of bounded average genus, which leads to a linear time algorithm for isomorphism of such graphs."
Supported in part by Engineering Excellence Award from Texas A&M University
Technical report (Texas A & M University. Computer Science Department) ; 91-015