Dilworth Decomposition in C++ using the LEDA Graph library

Sid Touati (1)

1 KAIROS - Logical Time for Formal Embedded System Design

In memory of Vincent Bouchitté, former professor at Ecole Normale Supérieur de Lyon : Dilworth Decomposition (Maximal Antichain in Orders, resp. Minimal Chain Decomposition).

Domaines: Informatique; Informatique et langage [cs.CL]

Sid Touati. Dilworth Decomposition in C++ using the LEDA Graph library. 2021, ⟨swh:1:dir:96814a40df85e15f23dec922f30ed0ce5c3f6336;origin=https://hal.archives-ouvertes.fr/hal-03445891;visit=swh:1:snp:a39dbdfa45e4a236e06b22efb7f9495b7b621416;anchor=swh:1:rel:945df584d6c66ea6973544f084124038c4d0a51f;path=/⟩. ⟨hal-03445891⟩