Matching cutsets in graphs of diameter 2 (Q955037)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5368360
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Matching cutsets in graphs of diameter 2 |
scientific article; zbMATH DE number 5368360 |
Statements
Matching cutsets in graphs of diameter 2 (English)
0 references
18 November 2008
0 references
matching cutset
0 references
stable cutset
0 references
graph algorithms
0 references
0 references
0.93619734
0 references
0.9239951
0 references
0.9132098
0 references
0.9041085
0 references
0.9041085
0 references
0.89594984
0 references
0.88950384
0 references
0.8893541
0 references
0.8877158
0 references
