Bounded Arboricity to Determine the Local Structure of Sparse Graphs
From MaRDI portal
Publication:3522953
DOI10.1007/11917496_15zbMath1167.68408OpenAlexW1499514251MaRDI QIDQ3522953
Publication date: 4 September 2008
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11917496_15
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)
Related Items (5)
Fully dynamic MIS in uniformly sparse graphs ⋮ A new decomposition technique for maximal clique enumeration for sparse graphs ⋮ Maximal strongly connected cliques in directed graphs: algorithms and bounds ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Bounded Arboricity to Determine the Local Structure of Sparse Graphs
