Polynomial time recognition of essential graphs having stability number equal to matching number (Q497363): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00373-014-1483-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2099703290 / rank | |||
Normal rank | |||
Revision as of 01:00, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time recognition of essential graphs having stability number equal to matching number |
scientific article |
Statements
Polynomial time recognition of essential graphs having stability number equal to matching number (English)
0 references
24 September 2015
0 references
maximum stable set
0 references
maximum matching
0 references
polynomial time algorithm
0 references
