New Results on Directed Edge Dominating Set (Q5005171): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
New Results on Directed Edge Dominating Set
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerate and Measure: Improving Parameter Budget Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal dynamic program for r-domination problems over tree decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation bounds for edge dominating set in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation hardness of edge dominating set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical approach to parallel repetition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating <i>k</i>-center in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / 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: On two techniques of combining branching and treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-approximation algorithm for the minimum weight edge dominating set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels for Edge Dominating Set: Simpler or Smaller / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Directed Covering and Domination Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of line digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Edge Dominating Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Algorithm for Parameterized Edge Dominating Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of dissociation set problems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating edge dominating set in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New parameterized algorithms for the edge dominating set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A refined exact algorithm for edge dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2889284842 / rank
 
Normal rank
Property / title
 
New Results on Directed Edge Dominating Set (English)
Property / title: New Results on Directed Edge Dominating Set (English) / rank
 
Normal rank

Latest revision as of 10:25, 30 July 2024

scientific article; zbMATH DE number 7378384
Language Label Description Also known as
English
New Results on Directed Edge Dominating Set
scientific article; zbMATH DE number 7378384

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    4 August 2021
    0 references
    edge dominating set
    0 references
    tournaments
    0 references
    treewidth
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    New Results on Directed Edge Dominating Set (English)
    0 references

    Identifiers