Sciweavers

57 search results - page 5 / 12
» isaac 2004
Sort
View
ISAAC
2004
Springer
103views Algorithms» more  ISAAC 2004»
15 years 2 months ago
Structural Similarity in Graphs (A Relaxation Approach for Role Assignment)
Standard methods for role assignment partition the vertex set of a graph in such a way that vertices in the same class can be considered to have equivalent roles in the graph. Seve...
Ulrik Brandes, Jürgen Lerner
ISAAC
2004
Springer
100views Algorithms» more  ISAAC 2004»
15 years 2 months ago
Boundary-Optimal Triangulation Flooding
Given a planar triangulation all of whose faces are initially white, we study the problem of colouring the faces black one by one so that the boundary between black and white faces...
Richard J. Nowakowski, Norbert Zeh
ISAAC
2004
Springer
102views Algorithms» more  ISAAC 2004»
15 years 2 months ago
On-Line Windows Scheduling of Temporary Items
In this paper we study on-line windows scheduling (WS) of temporary items. In a broadcasting system, there are some broadcast channels, each can broadcast one item in one time unit...
Wun-Tat Chan, Prudence W. H. Wong
ISAAC
2004
Springer
94views Algorithms» more  ISAAC 2004»
15 years 2 months ago
Error Compensation in Leaf Root Problems
The k-Leaf Root problem is a particular case of graph power problems. Here, we study “error correction” versions of k-Leaf Root—that is, for instance, adding or deleting at m...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
ISAAC
2004
Springer
79views Algorithms» more  ISAAC 2004»
15 years 2 months ago
Paired Pointset Traversal
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...
Peter Hui, Marcus Schaefer