• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

On the NP-completeness of the perfect matching free subgraph problem

Lacroix, Mathieu; Mahjoub, Ali Ridha; Martin, Sébastien; Picouleau, Christophe (2012), On the NP-completeness of the perfect matching free subgraph problem, Theoretical Computer Science, 423, p. 25-29. http://dx.doi.org/10.1016/j.tcs.2011.12.065

View/Open
cahier_312-1.pdf (260.1Kb)
Type
Article accepté pour publication ou publié
Date
2012
Journal name
Theoretical Computer Science
Volume
423
Publisher
Elsevier
Pages
25-29
Publication identifier
http://dx.doi.org/10.1016/j.tcs.2011.12.065
Metadata
Show full item record
Author(s)
Lacroix, Mathieu cc
Mahjoub, Ali Ridha
Martin, Sébastien cc
Picouleau, Christophe cc
Abstract (EN)
Given a bipartite graph G=(U∪V,E) such that ∣U∣=∣V∣ and every edge is labelled true or false or both, the perfect matching free subgraph problem is to determine whether or not there exists a subgraph of G containing, for each node u of U, either all the edges labelled true or all the edges labelled false incident to u, and which does not contain a perfect matching. This problem arises in the structural analysis of differential-algebraic systems. The purpose of this paper is to show that this problem is NP-complete. We show that the problem is equivalent to the stable set problem in a restricted case of tripartite graphs. Then we show that the latter remains NP-complete in that case. We also prove the NP-completeness of the related minimum blocker problem in bipartite graphs with perfect matching.
Subjects / Keywords
Bipartite graph; Matching; Structural analysis problem; NP-complete; Tripartite graph; Stable set; Blocker

Related items

Showing items related by title and author.

  • Thumbnail
    The vertex k-cut problem 
    Cornaz, Denis; Furini, Fabio; Lacroix, Mathieu; Malaguti, Enrico; Mahjoub, Ali Ridha; Martin, Sébastien (2019) Article accepté pour publication ou publié
  • Thumbnail
    Mathematical formulations for the Balanced Vertex k-Separator Problem 
    Cornaz, Denis; Furini, Fabio; Lacroix, Mathieu; Malaguti, Enrico; Mahjoub, Ali Ridha; Martin, Sébastien (2014) Communication / Conférence
  • Thumbnail
    Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem 
    Lacroix, Mathieu; Mahjoub, Ali Ridha; Martin, Sébastien (2012) Communication / Conférence
  • Thumbnail
    The vertex k-cut problem 
    Cornaz, Denis; Furini, Fabio; Lacroix, Mathieu; Malaguti, Enrico; Mahjoub, Ali Ridha; Martin, Sébastien (2019) Article accepté pour publication ou publié
  • Thumbnail
    Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems. 
    Martin, Sébastien; Mahjoub, Ali Ridha; Lacroix, Mathieu (2011) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo