On the NP-completeness of the perfect matching free subgraph problem (Q418003): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| 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 | |||
Latest revision as of 05: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
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
