scientific article
From MaRDI portal
Publication:2857369
zbMath1274.05407MaRDI QIDQ2857369
Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov, Florent Foucaud
Publication date: 1 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311001259
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- On the size of identifying codes in triangle-free graphs
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- On graphs having a \(V\setminus \{x\}\) set as an identifying code
- Minimal identifying codes in trees and planar graphs with large girth
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- Linear time solvable optimization problems on graphs of bounded clique-width
- Extremal graphs for the identifying code problem
- On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)
- Line perfect graphs
- The Complexity of Multiterminal Cuts
- On a new class of codes for identifying vertices in graphs
This page was built for publication:
