1857 search results - page 97 / 372 » Minimum Degree Orderings |
180
click to vote
AAIM
2007
Springer
16 years 19 days ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
168
click to vote
COMPGEOM
2006
ACM
16 years 12 days ago
2006
ACM
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
160
click to vote
TIME
2005
IEEE
16 years 20 hour ago
2005
IEEE
Information often comes from different sources and merging these sources usually leads to the apparition of inconsistencies. Fusion is the operation which consists in restoring th...
152
click to vote
FCT
2005
Springer
15 years 12 months ago
2005
Springer
We present an algorithm which calculates a minimum cut and its weight in an undirected graph with nonnegative real edge weights, n vertices and m edges, in time O( ` max (log n, mi...
157
click to vote
ADHOCNOW
2003
Springer
15 years 11 months ago
2003
Springer
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...