92 search results - page 13 / 19 » Applications of Parameterized st-Orientations in Graph Drawi... |
69
Voted
DATE
2004
IEEE
15 years 3 months ago
2004
IEEE
This paper presents an exploration algorithm which examines execution time and energy consumption of a given application, while considering a parameterized memory architecture. Th...
122
Voted
ICIP
2000
IEEE
16 years 21 days ago
2000
IEEE
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...
101
Voted
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices v, of the difference betwe...
118
Voted
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
113
click to vote
WEA
2010
Springer
15 years 6 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...