A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios (Q1278660): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-weighted graphs having the König-Egerváry property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers of graphs - an extension of the Koenig-Egervary theorem / 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: Three short proofs in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 18:36, 28 May 2024

scientific article
Language Label Description Also known as
English
A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
scientific article

    Statements

    A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios (English)
    0 references
    0 references
    0 references
    22 February 1999
    0 references
    heuristics
    0 references
    König-Egervary graphs
    0 references
    polynomial time algorithm
    0 references
    maximum independent set problem
    0 references

    Identifiers