The Linear Complexity of a Graph
From MaRDI portal
Publication:3463387
DOI10.1002/9783527670468.CH06zbMATH Open1328.05184OpenAlexW2147789738MaRDI QIDQ3463387
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
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
A bound for the complexity of a simple graph ⋮ 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
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)
