An approximation algorithm for the maximum independent set problem in cubic planar graphs (Q3787812): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Q236858 / rank | |||
Property / author | |||
Property / author: John V. Franco / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1002/net.3230160402 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2158991247 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank |
Latest revision as of 17:18, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An approximation algorithm for the maximum independent set problem in cubic planar graphs |
scientific article |
Statements
An approximation algorithm for the maximum independent set problem in cubic planar graphs (English)
0 references
1986
0 references
polynomial time approximation algorithm
0 references
maximal independent set
0 references
cubic planar graphs
0 references