TL;DR
This paper presents SMS, a new algorithm for computing graph treedepth by branching on small minimal separators, submitted to the PACE 2020 competition.
Contribution
The paper introduces SMS, a novel method for treedepth computation focusing on minimal separators, advancing exact algorithms in this domain.
Findings
SMS effectively computes treedepth using minimal separators.
The approach performs well in PACE 2020 benchmarks.
SMS offers a new strategy for exact treedepth calculation.
Abstract
We describe SMS, our submission to the exact treedepth track of PACE 2020. SMS computes the treedepth of a graph by branching on the small minimal separators of the graph.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
