Exact algorithms for minimum weighted dominating induced matching (Q521800): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-015-0095-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2299776542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the weighted efficient edge domination problem on bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Edge Domination on Hole-Free Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Induced Matchings for P 7-free Graphs in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the dominating induced matching problem in hereditary classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient edge domination in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Induced Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even Faster Exact Bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting models for 2SAT and 3SAT formulae / 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: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient edge domination problems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Algorithm for Dominating Set Analyzed by the Potential Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for dominating induced matching based on graph partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect edge domination and efficient edge domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hereditary Efficiently Dominatable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Stars and the Number Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion/Exclusion Meets Measure and Conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances / rank
 
Normal rank

Latest revision as of 15:55, 13 July 2024

scientific article
Language Label Description Also known as
English
Exact algorithms for minimum weighted dominating induced matching
scientific article

    Statements

    Exact algorithms for minimum weighted dominating induced matching (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 April 2017
    0 references
    exact algorithms
    0 references
    dominating induced matchings
    0 references
    0 references
    0 references
    0 references

    Identifiers