Domination When the Stars Are Out (Q3012826): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Created claim: Wikidata QID (P12): Q128003225, #quickstatements; #temporary_batch_1722364966119
 
(2 intermediate revisions by 2 users not shown)
description / endescription / en
 
scientific article; zbMATH DE number 7136417
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1454.68104 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1145/3301445 / rank
 
Normal rank
Property / published in
 
Property / published in: ACM Transactions on Algorithms / rank
 
Normal rank
Property / publication date
 
25 November 2019
Timestamp+2019-11-25T00:00:00Z
Timezone+00:00
Calendar⧼valueview-expert-timevalue-calendar-gregorian⧽
Precision1 day
Before0
After0
Property / publication date: 25 November 2019 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7136417 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2942029771 / rank
 
Normal rank
Property / zbMATH Keywords
 
claw-free graphs
Property / zbMATH Keywords: claw-free graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
connected dominating set
Property / zbMATH Keywords: connected dominating set / rank
 
Normal rank
Property / zbMATH Keywords
 
dominating set
Property / zbMATH Keywords: dominating set / rank
 
Normal rank
Property / zbMATH Keywords
 
fixed-parameter tractable
Property / zbMATH Keywords: fixed-parameter tractable / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial kernel
Property / zbMATH Keywords: polynomial kernel / rank
 
Normal rank
Property / cites work
 
Property / cites work: On domination and independent domination numbers of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate version of Hadwiger's conjecture for claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring quasi-line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. V. Global structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating set is fixed parameter tractable in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stable set polytope of quasi-line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs---a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365068 / 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: edge dominating set: Efficient Enumeration-Based Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2861525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms on circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding χ in terms of ω and Δ for quasi-line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Independence and Domination on Geometric Graphs / 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: Q2908840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained weighted matchings and edge coverings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128003225 / rank
 
Normal rank

Latest revision as of 19:56, 30 July 2024

scientific article; zbMATH DE number 7136417
Language Label Description Also known as
English
Domination When the Stars Are Out
scientific article; zbMATH DE number 7136417

    Statements

    Domination When the Stars Are Out (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 July 2011
    0 references
    25 November 2019
    0 references
    claw-free graphs
    0 references
    connected dominating set
    0 references
    dominating set
    0 references
    fixed-parameter tractable
    0 references
    polynomial kernel
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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