Compression methods for graph algorithms

Summary

Compression methods for graph algorithms is a doctoral thesis^[1].

Key Facts

• Compression methods for graph algorithms's instance of is recorded as doctoral thesis^[2].
• Compression methods for graph algorithms's publisher is recorded as UC Research Repository^[3].
• Compression methods for graph algorithms's DOI is recorded as 10.26021/3214^[4].
• Compression methods for graph algorithms's language of work or name is recorded as English^[5].
• Compression methods for graph algorithms's country of origin is recorded as New Zealand^[6].
• Compression methods for graph algorithms's publication date is recorded as +1985-00-00T00:00:00Z^[7].
• Compression methods for graph algorithms's main subject is recorded as computer science^[8].
• Compression methods for graph algorithms's work available at URL is recorded as https://ir.canterbury.ac.nz/handle/10092/9568^[9].
• Compression methods for graph algorithms's Handle ID is recorded as 10092/9568^[10].
• Compression methods for graph algorithms's title is recorded as Compression methods for graph algorithms^[11].
• Compression methods for graph algorithms's author name string is recorded as S. A. Freeth^[12].
• Compression methods for graph algorithms's thesis submitted to is recorded as University of Canterbury^[13].
• Compression methods for graph algorithms's on focus list of Wikimedia project is recorded as NZThesisProject^[14].
• Compression methods for graph algorithms's copyright status is recorded as copyrighted^[15].
• Compression methods for graph algorithms's online access status is recorded as open access^[16].

Body

Designation and Status

Compression methods for graph algorithms's instance of is recorded as doctoral thesis^[2].