Computing the forcing and anti-forcing numbers of perfect matchings for graphs by integer linear programmings (Q5091506): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (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.46793/match.87-3.561l / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3215869494 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:14, 30 July 2024
scientific article; zbMATH DE number 7564164
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the forcing and anti-forcing numbers of perfect matchings for graphs by integer linear programmings |
scientific article; zbMATH DE number 7564164 |
Statements
Computing the forcing and anti-forcing numbers of perfect matchings for graphs by integer linear programmings (English)
0 references
26 July 2022
0 references
