Computing the Degeneracy of Large Graphs

DOI10.1007/978-3-642-54423-1_22zbMath1405.68442OpenAlexW329650226MaRDI QIDQ5405044

Martín Farach-Colton, Meng-Tsung Tsai

Publication date: 31 March 2014

Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54423-1_22

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Finding Articulation Points of Large Graphs in Linear Time ⋮ Single-pass streaming algorithms to partition graphs into few forests

This page was built for publication: Computing the Degeneracy of Large Graphs