Dilworth Decomposition in C++ using the LEDA Graph library - Archive ouverte HAL Access content directly
Software Year : 2021

Dilworth Decomposition in C++ using the LEDA Graph library

Sid Touati
  • Function : Author
  • PersonId : 962200

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).
49 View
22 Download

Share

Gmail Mastodon Facebook X LinkedIn More