Skip to Main content Skip to Navigation
Journal articles

Satisfiability and matchings in bipartite graphs: relationship and tractability

Belaïd Benhamou 1
1 LSIS - Laboratoire des Sciences de l'Information et des Systèmes
Abstract : no abstract
Document type :
Journal articles
Complete list of metadata
https://hal-amu.archives-ouvertes.fr/hal-01479584
Contributor : William Domingues Vinhas <>
Submitted on : Tuesday, February 28, 2017 - 8:39:45 PM
Last modification on : Monday, March 30, 2020 - 8:53:18 AM

Identifiers

  • HAL Id : hal-01479584, version 1

Collections

UNIV-AMU | LSIS | LSIS-INCA | CNRS | UNIV-TLN | LIS-LAB | ARTS-ET-METIERS-SCIENCES-ET-TECHNOLOGIES

Citation

Belaïd Benhamou. Satisfiability and matchings in bipartite graphs: relationship and tractability. The journal of Spanish Royal Academy of sciences (RACSAM), a special issu on Symbolic Computation and Artificial Intelligence, 2004, 98 ((1--2)), pp.55 - 63. ⟨hal-01479584⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

124