Dilworth Decomposition in C++ using the LEDA Graph library

Sid Touati

Software Year : 2021

Dilworth Decomposition in C++ using the LEDA Graph library

(1)

Sid Touati

Function : Author
PersonId : 962200

Logical Time for Formal Embedded System Design

Abstract

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

Domains

Computer science Computation and Language [cs.CL]

Sid Touati : Connect in order to contact the contributor

https://hal.science/hal-03445891

Submitted on : Thursday, November 25, 2021-11:11:58 AM

Last modification on : Monday, February 26, 2024-11:22:14 AM

Dates and versions

hal-03445891 , version 1 (25-11-2021)

Identifiers

HAL Id : hal-03445891 , version 1
SWHID : swh:1:dir:96814a40df85e15f23dec922f30ed0ce5c3f6336;origin=https://hal.archives-ouvertes.fr/hal-03445891;visit=swh:1:snp:a39dbdfa45e4a236e06b22efb7f9495b7b621416;anchor=swh:1:rel:945df584d6c66ea6973544f084124038c4d0a51f;path=/

version :
Software License : GNU General Public License v3.0 or later
Code Repository :

Cite

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⟩

Export

format_codemeta BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS INRIA I3S INRIA2 UNIV-COTEDAZUR

55 View

27 Download

Dilworth Decomposition in C++ using the LEDA Graph library

Abstract

Domains

Dates and versions

Identifiers

Metadata

Cite

Export

Collections

Share