Independent sets with domination constraints
Copyright policy )Independent sets with domination constraints
If \(\rho\) is a set of positive integers, then the \(\rho\)-IS problem is the problem to decide for a given graph \(G\), whether \(G\) has an independent set of vertices \(S\neq\varnothing\) with \(|S|\geq\min\{k\mid k\not\in\rho\}\) such that \(|N(v)\cap S|\in\rho\) for each \(v\in S\); here \(N(v)\) denotes the set of vertices adjacent to \(v\) in \(G\). Various cases of the \(\rho\)-IS problem are investigated from the viewpoint of algorithmic complexity.
- Charles University Czech Republic
- Iceland University of the Arts Iceland
- University of Bergen Norway
- University of Iceland Iceland
independent set, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), algorithmic complexity, Applied Mathematics, Discrete Mathematics and Combinatorics, Nonnumerical algorithms, IS problem, domination
independent set, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), algorithmic complexity, Applied Mathematics, Discrete Mathematics and Combinatorics, Nonnumerical algorithms, IS problem, domination
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).45 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!