Arboricity, \(h\)-index, and dynamic algorithms

DOI10.1016/j.tcs.2011.12.006zbMath1243.68228OpenAlexW1904294951MaRDI QIDQ418737

Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter

Publication date: 30 May 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.006

zbMATH Keywords

data structuresdynamic algorithmsdiamond-free graphsarboricitystrongly chordal graphs\(h\)-indexcop-win graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (5)

A unified approach to recognize squares of split graphs ⋮ Local community detection based on small cliques ⋮ The complexity of growing a graph ⋮ Comparability digraphs: an analogue of comparability graphs ⋮ Improved Dynamic Graph Coloring

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding and counting small induced subgraphs efficiently
• Finding and counting given length cycles
• On the complexity of fixed parameter clique and dominating set
• Clique graphs and Helly graphs
• Matrix multiplication via arithmetic progressions
• Characterizations of strongly chordal graphs
• Coloring perfect \((K_ 4\)-e)-free graphs
• Efficient graph representations
• Recognizing quasi-triangulated graphs.
• On uniquely intersectable graphs
• Vertex-to-vertex pursuit in a graph
• Doubly lexical ordering of dense 0--1 matrices
• The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
• Arboricity and Subgraph Listing Algorithms
• Three Partition Refinement Algorithms

This page was built for publication: Arboricity, \(h\)-index, and dynamic algorithms