For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
We derive efficient algorithms for both detecting and representing matchings in lopsided bipartite graphs; such graphs have so many nodes on one side that it is infeasible to repr...
Denis Charles, Max Chickering, Nikhil R. Devanur, ...
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
Christian Desrosiers, Philippe Galinier, Alain Her...
Given an edge-weighted graph where all weights are nonnegative reals, an edge reweighting is an assignment of nonnegative reals to edges such that, for each vertex, the sums of giv...