Algorithmic aspects of open neighborhood location-domination in graphs

DOI10.1016/J.DAM.2015.03.002zbMATH Open1350.05124OpenAlexW269097313MaRDI QIDQ344871FDOQ344871

Arti Pandey, B. S. Panda

Publication date: 24 November 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.03.002

zbMATH Keywords

approximation algorithmgraph algorithmdominationNP-completechordal graphAPX-complete

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Introduction to algorithms
• Reducibility among Combinatorial Problems
• Some APX-completeness results for cubic graphs
• Incidence matrices and interval graphs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• A survey of selected recent results on total domination in graphs
• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• Dually Chordal Graphs
• Approximation hardness of dominating set problems in bounded degree graphs
• Algorithmic aspects of \(k\)-tuple total domination in graphs
• Open neighborhood locating-dominating in trees

Cited In (5)

• The adjacency dimension of graphs
• Characterizing extremal graphs for open neighbourhood location-domination
• Title not available (Why is that?)
• Linear-time algorithms for three domination-based separation problems in block graphs
• Extremal Digraphs for open neighbourhood location-domination and identifying codes

This page was built for publication: Algorithmic aspects of open neighborhood location-domination in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344871)