Computing the degeneracy of large graphs

DOI10.1007/978-3-642-54423-1_22zbMATH Open1405.68442OpenAlexW329650226MaRDI QIDQ5405044FDOQ5405044

Authors: Martin 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

Recommendations

• Tight Approximations of Degeneracy in Large Graphs
• External-memory network analysis algorithms for naturally sparse graphs
• Automata, Languages and Programming
• Listing all maximal cliques in large sparse real-world graphs
• On graph problems in a semi-streaming model

Mathematics Subject Classification ID

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

Cited In (9)

• Decomposing large graphs with small graphs of high density
• Finding articulation points of large graphs in linear time
• Single-pass streaming algorithms to partition graphs into few forests
• Computing the largest bond of a graph
• Title not available (Why is that?)
• Tight Approximations of Degeneracy in Large Graphs
• Degeneracy subgraph of the Lemke complementary pivot algorithm and anticycling rule
• Degeneracy graphs and the neighbourhood problem
• External-memory network analysis algorithms for naturally sparse graphs

This page was built for publication: Computing the degeneracy of large graphs

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