Solving the single step graph searching problem by solving the maximum two-independent set problem (Q1183488): Difference between revisions
From MaRDI portal
Removed claims |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Ju-Yuan Hsiao / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Ruay-Shiung Chang / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 |
Latest revision as of 15:48, 15 May 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