Satisfiability and matchings in bipartite graphs: relationship and tractability
Abstract
no abstract
Journal Articles
The journal of Spanish Royal Academy of sciences (RACSAM), a special issu on Symbolic Computation and Artificial Intelligence
Year : 2004
William Domingues Vinhas : Connect in order to contact the contributor
https://hal-amu.archives-ouvertes.fr/hal-01479584
Submitted on : Tuesday, February 28, 2017-8:39:45 PM
Last modification on : Wednesday, February 8, 2023-5:11:01 PM
Dates and versions
Identifiers
- HAL Id : hal-01479584 , version 1
Cite
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⟩
54
View
0
Download