Parameterized edge dominating set in graphs with degree bounded by 3 (Q388085): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.tcs.2012.08.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000108275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Independent Set in Graphs of Average Degree at Most Three in ${\mathcal O}(1.08537^n)$ / 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: New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Exact Algorithm for Cubic Graph TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient exact algorithms through enumerating maximal independent sets and other techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for Edge Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Vertex Cover in Graphs with Maximum Degree 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Edge Dominating Set in Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank

Latest revision as of 04:48, 7 July 2024

scientific article
Language Label Description Also known as
English
Parameterized edge dominating set in graphs with degree bounded by 3
scientific article

    Statements

    Parameterized edge dominating set in graphs with degree bounded by 3 (English)
    0 references
    0 references
    0 references
    19 December 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    parameterized algorithm
    0 references
    edge dominating set
    0 references
    cubic graphs
    0 references
    0 references