Solving the single step graph searching problem by solving the maximum two-independent set problem (Q1183488)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving the single step graph searching problem by solving the maximum two-independent set problem |
scientific article; zbMATH DE number 33328
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the single step graph searching problem by solving the maximum two-independent set problem |
scientific article; zbMATH DE number 33328 |
Statements
Solving the single step graph searching problem by solving the maximum two-independent set problem (English)
0 references
28 June 1992
0 references
graph searching problem
0 references
