Q5009468 (Q5009468): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / 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: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(H\)-topological intersection 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: On the tractability of optimization problems on \(H\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4029974 / 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: Q3304141 / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:45, 26 July 2024

scientific article; zbMATH DE number 7378592
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7378592

    Statements

    0 references
    0 references
    0 references
    4 August 2021
    0 references
    graph width parameters
    0 references
    graph classes
    0 references
    distance domination problems
    0 references
    parameterized complexity
    0 references

    Identifiers