PACE Solver Description: tdULL

Brokkelkamp, Ruben; Venetië, Raymond; de Vries, Mees; Westerdiep, Jan

doi:10.4230/LIPIcs.IPEC.2020.29

K.R. Brokkelkamp (Ruben), van Venetië (Raymond), M.J. de Vries (Mees) and J. Westerdiep (Jan)

2020-12-15

PACE Solver Description: tdULL

Presented at the Parameterized Algorithms and Computational Experiments (June 2020), Online

We describe tdULL, an algorithm for computing treedepth decompositions of minimal depth. An implementation was submitted to the exact track of PACE 2020. tdULL is a branch and bound algorithm branching on inclusion-minimal separators.

Additional Metadata
Keywords	PACE 2020, Treedepth, Treedepth decomposition, Vertex ranking, Minimal separators, Branch and bound
Persistent URL	doi.org/10.4230/LIPIcs.IPEC.2020.29
Conference	Parameterized Algorithms and Computational Experiments
Organisation	Networks and Optimization
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Brokkelkamp, R., van Venetië, R., de Vries, M., & Westerdiep, J. (2020). PACE Solver Description: tdULL. In 15th International Symposium on Parameterized and Exact Computation. doi:10.4230/LIPIcs.IPEC.2020.29

View at Publisher

Free Full Text ( Final Version , 338kb )

See Also
software tdULL M.J. de Vries (Mees), K.R. Brokkelkamp (Ruben), van Venetië (Raymond) and J. Westerdiep (Jan)

PACE Solver Description: tdULL

Publication

Publication

software
tdULL

Address

Publishing at CWI

Questions or comments?

PACE Solver Description: tdULL

Publication

Publication

software tdULL

Workflow

Workflow

Add Content

software
tdULL