A combinatorial branch and bound for the safe set problem (Q6179692): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Safe sets in graphs: graph classes and structural parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network majority on tree topological network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Safe Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating connected safe sets in weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe set problem on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable structure on safe set problems in vertex-weighted graphs. II: Recognition and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable structure on safe set problems in vertex-weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compact mixed integer linear formulation for safe set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new formulation for the safe set problem on graphs / rank
 
Normal rank

Latest revision as of 15:47, 21 August 2024

scientific article; zbMATH DE number 7780095
Language Label Description Also known as
English
A combinatorial branch and bound for the safe set problem
scientific article; zbMATH DE number 7780095

    Statements

    Identifiers

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