Mim-width. III. Graph powers and generalized distance domination problems (Q2333800): 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.2019.09.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2972989051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of geometric intersection graphs and dispersion algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4634386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph classes with structured neighborhoods and algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterising \((k,\ell )\)-leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairwise Compatibility Graphs: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(H\)-topological intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for \(k\)-domination and total \(k\)-domination in proper interval 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: On powers of \(m\)-trapezoid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width of path powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4029974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mim-width. III. Graph powers and generalized distance domination problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mim-width. II. The feedback vertex set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3304141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strongly chordal graphs that are not leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the mim-width of some graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a characterization of leaf powers by clique arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4032992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of computing width parameters based on branch decompositions over the vertex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>R</i> -Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The point-set embeddability problem for plane graphs / rank
 
Normal rank

Latest revision as of 22:13, 20 July 2024

scientific article
Language Label Description Also known as
English
Mim-width. III. Graph powers and generalized distance domination problems
scientific article

    Statements

    Mim-width. III. Graph powers and generalized distance domination problems (English)
    0 references
    0 references
    0 references
    0 references
    13 November 2019
    0 references
    graph width parameters
    0 references
    graph classes
    0 references
    distance domination problems
    0 references
    parameterized complexity
    0 references
    graph powers
    0 references
    leaf powers
    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