Spelling suggestions: "subject:"graph 1inear complexity"" "subject:"graph 1inear komplexity""
1 |
Graph Linear ComplexityWinerip, Jason 01 May 2008 (has links)
This thesis expands on the notion of linear complexity for a graph as defined by Michael Orrison and David Neel in their paper "The Linear Complexity of a Graph." It considers additional classes of graphs and provides upper bounds for additional types of graphs and graph operations.
|
Page generated in 0.0694 seconds