An algorithm for the maximum internally stable set in a weighted graph (Q3968462): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the Stability Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-blocking polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the number of internal stability of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding maximum cliques in circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Independent Set / rank
 
Normal rank

Latest revision as of 16:44, 13 June 2024

scientific article
Language Label Description Also known as
English
An algorithm for the maximum internally stable set in a weighted graph
scientific article

    Statements

    Identifiers