Join Our Newsletter

123 search results - page 1 / 25» Graph Orientation Algorithms to Minimize the Maximum Outdegr... |

CATS

2006

11 years 6 months ago
2006

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...

AAIM

2007

Springer

11 years 11 months ago
2007

Springer

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...

CATS

2008

11 years 6 months ago
2008

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...

DAM

2008

11 years 5 months ago
2008

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...

ALGORITHMICA

2004

11 years 5 months ago
2004

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 ...