A heuristic approach to the treedepth decomposition problem for large graphs

DOI10.1007/978-3-030-86838-3_13OpenAlexW3201541230WikidataQ115198414 ScholiaQ115198414MaRDI QIDQ2672434

Marta Kasprzak, Sylwester Swat

Publication date: 8 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-86838-3_13

zbMATH Keywords

separatorelimination treetreedepth decomposition

Mathematics Subject Classification ID

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

Uses Software

• ergm.graphlets
• GitHub

Cites Work

• Unnamed Item
• Sparsity. Graphs, structures, and algorithms
• Reordering sparse matrices for parallel elimination
• Finding minimum height elimination trees for interval graphs in polynomial time
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On vertex rankings of graphs and its relatives
• The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth
• Graph Bisection with Pareto-Optimization
• An improved equivalence algorithm

This page was built for publication: A heuristic approach to the treedepth decomposition problem for large graphs