HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
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 Connect in order to contact the contributor
Submitted on : Tuesday, February 28, 2017 - 8:39:45 PM
Last modification on : Friday, October 22, 2021 - 3:33:49 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 Datacite

Share

Metrics

Record views

53