Solving the single step graph searching problem by solving the maximum two-independent set problem (Q1183488): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Trapezoid graphs and their coloring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On chain and antichain families of a partially ordered set / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The edge inducibility of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3138888 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4159394 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The maximum k-colorable subgraph problem for chordal graphs / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(91)90124-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1979977220 / rank | |||
Normal rank | |||
Latest revision as of 11:58, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the single step graph searching problem by solving the maximum two-independent set problem |
scientific article |
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
