Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs

DOI10.1137/20M1327835zbMath1464.05334MaRDI QIDQ4997325

Jérémie Dusart, Michel A. Habib, Derek Gordon Corneil

Publication date: 29 June 2021

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

posetscocomparability graphsHamiltonian path problembump numberminimum path cover problemlexicographic depth first search

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs

This page was built for publication: Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs