Sciweavers

ALENEX
2007
102views Algorithms» more  ALENEX 2007»
13 years 5 months ago
Linearization: Locally Self-Stabilizing Sorting in Graphs
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
Melih Onus, Andréa W. Richa, Christian Sche...
ALENEX
2007
130views Algorithms» more  ALENEX 2007»
13 years 5 months ago
Locating Guards for Visibility Coverage of Polygons
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
Yoav Amit, Joseph S. B. Mitchell, Eli Packer
ALENEX
2007
104views Algorithms» more  ALENEX 2007»
13 years 5 months ago
Practical Entropy-Compressed Rank/Select Dictionary
Daisuke Okanohara, Kunihiko Sadakane
ALENEX
2007
105views Algorithms» more  ALENEX 2007»
13 years 5 months ago
ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
Martin Kutz, Pascal Schweitzer