Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

COMBINATORICS
2006

favoriteEmaildiscussreport

107views more COMBINATORICS 2006»

The Linear Complexity of a Graph

13 years 5 months ago

The Linear Complexity of a Graph

Download www.combinatorics.org

The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In this paper, we define the linear complexity of a graph to be the linear complexity of any one of its associated adjacency matrices. We then compute or give upper bounds for the linear complexity of several classes of graphs.

David L. Neel, Michael E. Orrison

Real-time Traffic

COMBINATORICS 2006 | Linear Complexity | Matrix | Scalar Multiplications |

claim paper

Related Content

» Complexity of some Path Problems in DAGs and Linear Orders

» A LinearTime Graph Kernel

» Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs

» Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time

» Time Complexity of Distributed Topological Selfstabilization The Case of Graph Linearizati...

» On the Complexity of Computing Treelength

» Linear Constraint Query Languages Expressive Power and Complexity

» The Rademacher Complexity of Linear Transformation Classes

» The Parameterized Complexity of the Induced Matching Problem in Planar Graphs

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	COMBINATORICS
Authors	David L. Neel, Michael E. Orrison

Comments (0)