On the complexity of the minimum outer-connected dominating set problem in graphs (Q5963605): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-013-9703-z / 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.1007/s10878-013-9703-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094446349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the outer-connected domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation hardness of dominating set problems in bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total outer-connected domination in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total outer-connected domination numbers of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total outer-connected domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3059038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a minimum outer-connected dominating set for the class of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-approximability results for optimization problems on bounded degree instances / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-013-9703-Z / rank
 
Normal rank

Latest revision as of 12:40, 9 December 2024

scientific article; zbMATH DE number 6544292
Language Label Description Also known as
English
On the complexity of the minimum outer-connected dominating set problem in graphs
scientific article; zbMATH DE number 6544292

    Statements

    Identifiers