Metric dimension parameterized by treewidth (Q2041987): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2996877459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric Dimension of Bounded Tree-length Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolvability in graphs and the metric dimension of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of metric dimension on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric Dimension Parameterized by Max Leaf Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The (weighted) metric dimension of graphs: hard and easy cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the metric dimension for chain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for metric dimension of cactus block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Landmarks in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval graphs and searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904144 / 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: Q4075485 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:24, 26 July 2024

scientific article
Language Label Description Also known as
English
Metric dimension parameterized by treewidth
scientific article

    Statements

    Metric dimension parameterized by treewidth (English)
    0 references
    0 references
    0 references
    0 references
    26 July 2021
    0 references
    metric dimension
    0 references
    treewidth
    0 references
    parameterized hardness
    0 references

    Identifiers