<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>
AbstractLet G(V, E) be a finite, undirected graph, and let l(X) be a set function on 2V. When can the edges of G be oriented so that the indegree of every subset X is at least l(X)? A necessary and sufficient condition is given for the existence of such an orientation when l(X) is “convex”.
Connectivity, minimax, Directed graphs (digraphs), tournaments, graph, digraph, orientation, submodular, Theoretical Computer Science, Graph theory, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics
Connectivity, minimax, Directed graphs (digraphs), tournaments, graph, digraph, orientation, submodular, Theoretical Computer Science, Graph theory, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics
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). | 66 | |
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 1% | |
impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |