On the NP-completeness of the perfect matching free subgraph problem (Q418003): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Ali Ridha Mahjoub / rank
Normal rank
 
Property / author
 
Property / author: Ali Ridha Mahjoub / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6034857 / rank
 
Normal rank
Property / zbMATH Keywords
 
bipartite graph
Property / zbMATH Keywords: bipartite graph / rank
 
Normal rank
Property / zbMATH Keywords
 
matching
Property / zbMATH Keywords: matching / rank
 
Normal rank
Property / zbMATH Keywords
 
blocker
Property / zbMATH Keywords: blocker / rank
 
Normal rank
Property / zbMATH Keywords
 
stable set
Property / zbMATH Keywords: stable set / rank
 
Normal rank
Property / zbMATH Keywords
 
tripartite graph
Property / zbMATH Keywords: tripartite graph / rank
 
Normal rank
Property / zbMATH Keywords
 
NP-complete
Property / zbMATH Keywords: NP-complete / rank
 
Normal rank
Property / zbMATH Keywords
 
structural analysis problem
Property / zbMATH Keywords: structural analysis problem / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.065 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2157200475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the NP-completeness of the perfect matching free subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices and matroids for systems analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blockers and transversals / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:44, 5 July 2024

scientific article
Language Label Description Also known as
English
On the NP-completeness of the perfect matching free subgraph problem
scientific article

    Statements

    On the NP-completeness of the perfect matching free subgraph problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 May 2012
    0 references
    bipartite graph
    0 references
    matching
    0 references
    blocker
    0 references
    stable set
    0 references
    tripartite graph
    0 references
    NP-complete
    0 references
    structural analysis problem
    0 references

    Identifiers