We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
Given an undirected graph with edge weights, we are asked to find an orientation, i.e., an assignment of a direction to each edge, so as to minimize the weighted maximum outdegree...
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...
Anne Berry, Jean R. S. Blair, Pinar Heggernes, Bar...