Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56551560, #quickstatements; #temporary_batch_1706974288397
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: W3101038336 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1405.2424 / 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: Minimal identifying codes in trees and planar graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Canonical Labeling of Strongly Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network verification via routing table queries / 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 Width Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4659582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On separating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying Codes in Hereditary Classes of Graphs and VC-Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity / 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: On locating and differetiating-total domination in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2717197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Metric Dimension / 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: Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying Codes in Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear time algorithm for cograph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating-total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a new class of codes for identifying vertices in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Landmarks in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How complex are random graphs in first order logic? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum metric dimension of honeycomb networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying and Locating–Dominating Codes in (Random) Geometric Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3279628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination and location in acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of identifying codes and locating-dominating codes / rank
 
Normal rank

Latest revision as of 12:10, 14 July 2024

scientific article
Language Label Description Also known as
English
Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
scientific article

    Statements

    Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 October 2017
    0 references
    metric dimension
    0 references
    resolving set
    0 references
    identifying code
    0 references
    locating-dominating set
    0 references
    interval graph
    0 references
    permutation graph
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references
    0 references