The computational complexity of dominating set problems for instances with bounded minors of constraint matrices (Q1662648): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q130041840, #quickstatements; #temporary_batch_1726345393210
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Dmitriy S. Malyshev / rank
Normal rank
 
Property / author
 
Property / author: Dmitriy S. Malyshev / 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.1016/j.disopt.2018.03.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2795518735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for bimodular integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer program with bimodular matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on non-degenerate integer programs with small sub-determinants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear and circular structure of (claw, net)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical properties of graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge dominating set and colorings on graphs with fixed clique-width / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130041840 / rank
 
Normal rank

Latest revision as of 21:23, 14 September 2024

scientific article
Language Label Description Also known as
English
The computational complexity of dominating set problems for instances with bounded minors of constraint matrices
scientific article

    Statements

    The computational complexity of dominating set problems for instances with bounded minors of constraint matrices (English)
    0 references
    0 references
    0 references
    20 August 2018
    0 references
    Boolean linear programming
    0 references
    dominating set problem
    0 references
    matrix minor
    0 references
    efficient algorithm
    0 references

    Identifiers