<script type="text/javascript">
<!--
document.write('<div id="oa_widget"></div>');
document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=undefined&type=result"></script>');
-->
</script>
Abstract Given a graph G = ( V , E ) and a vector of nonnegative integers R [ u ] u ∈ V (the vertex requirements), a set S ⊆ V is an R-dominating set of G if each u ∈ V ∖ S has at least R [ u ] neighbors in S. The Vector Domination problem aims at finding a minimum R-dominating set S. In this work we describe an O ( n ) -time algorithm to solve Vector Domination in split-indifference graphs.
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). | 3 | |
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. | Average | |
influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |