More results on the complexity of identifying problems in graphs (Q264560): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Antoine C. Lobstein / rank
Normal rank
 
Property / author
 
Property / author: Antoine C. Lobstein / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6561609 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph theory
Property / zbMATH Keywords: graph theory / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity classes
Property / zbMATH Keywords: complexity classes / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial hierarchy
Property / zbMATH Keywords: polynomial hierarchy / rank
 
Normal rank
Property / zbMATH Keywords
 
NP-completeness
Property / zbMATH Keywords: NP-completeness / rank
 
Normal rank
Property / zbMATH Keywords
 
hardness
Property / zbMATH Keywords: hardness / rank
 
Normal rank
Property / zbMATH Keywords
 
identifying codes
Property / zbMATH Keywords: identifying codes / rank
 
Normal rank
Property / zbMATH Keywords
 
twin-free graphs
Property / zbMATH Keywords: twin-free graphs / 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.tcs.2016.01.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2276120567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying Codes in Trees and Planar Graphs / 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: Complexity results for identifying codes in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New identifying codes in the binary Hamming space / 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: Q2717197 / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Kemeny elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4510800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On identifying codes in binary Hamming spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the identification problem in Hamming spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of Slater's problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: More results on the complexity of identifying problems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / 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: Q4298260 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:31, 11 July 2024

scientific article
Language Label Description Also known as
English
More results on the complexity of identifying problems in graphs
scientific article

    Statements

    More results on the complexity of identifying problems in graphs (English)
    0 references
    0 references
    0 references
    31 March 2016
    0 references
    graph theory
    0 references
    complexity classes
    0 references
    polynomial hierarchy
    0 references
    NP-completeness
    0 references
    hardness
    0 references
    identifying codes
    0 references
    twin-free graphs
    0 references

    Identifiers