On approximation properties of the Independent set problem for degree 3 graphs (Q5057456): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): conf/wads/BermanF95, #quickstatements; #temporary_batch_1731508824982
 
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-60220-8_84 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3166880264 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56335600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greed is good / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximations of independent sets in bounded-degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient bounds for the stable set, vertex cover and set packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Syntactic versus Computational Views of Approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three short proofs in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: conf/wads/BermanF95 / rank
 
Normal rank

Latest revision as of 16:30, 13 November 2024

scientific article; zbMATH DE number 7633564
Language Label Description Also known as
English
On approximation properties of the Independent set problem for degree 3 graphs
scientific article; zbMATH DE number 7633564

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references