Satisfiability and matchings in bipartite graphs: relationship and tractability - Aix-Marseille Université Access content directly
Journal Articles The journal of Spanish Royal Academy of sciences (RACSAM), a special issu on Symbolic Computation and Artificial Intelligence Year : 2004

Satisfiability and matchings in bipartite graphs: relationship and tractability

Abstract

no abstract
No file

Dates and versions

hal-01479584 , version 1 (28-02-2017)

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

Share

Gmail Facebook X LinkedIn More