Fast algorithms for some dominating induced matching problems (Q2015144): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jayme Luiz Szwarcfiter / rank
Normal rank
 
Property / author
 
Property / author: Jayme Luiz Szwarcfiter / 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.1016/j.ipl.2014.04.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012724105 / 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: Dominating Induced Matchings for P 7-free Graphs in Linear Time / 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: O(n) Time Algorithms for Dominating Induced Matching Problems / 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: Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient edge domination problems in graphs / 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: Perfect edge domination and efficient edge domination in graphs / rank
 
Normal rank

Latest revision as of 15:22, 8 July 2024

scientific article
Language Label Description Also known as
English
Fast algorithms for some dominating induced matching problems
scientific article

    Statements

    Identifiers