The linear complexity of a graph

DOI10.1002/9783527670468.CH06zbMATH Open1328.05184OpenAlexW2147789738MaRDI QIDQ3463387FDOQ3463387

Authors: Michael E. Orrison, David L. Neel 

Publication date: 14 January 2016

Published in: Advances in Network Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/9783527670468.ch06

Recommendations

• The linear complexity of a graph
• Entropy and the complexity of graphs revisited
• Computational complexity of graphs
• Advances in network complexity
• On measuring the complexity of networks: Kolmogorov complexity versus entropy

zbMATH Keywords

graphadjacency matrixlower boundupper boundlinear complexity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cited In (6)

• A bound for the complexity of a simple graph
• The complexity of finite graphs
• The complexity of growing a graph
• Comparison between the complexity of a function and the complexity of its graph
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• The linear complexity of a graph

This page was built for publication: The linear complexity of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3463387)