Sciweavers

365 search results - page 18 / 73
» Reconfigurations in Graphs and Grids
Sort
View
CORR
2010
Springer
73views Education» more  CORR 2010»
14 years 12 months ago
On Touching Triangle Graphs
Abstract. In this paper, we consider the problem of representing graphs by triangles whose sides touch. We present linear time algorithms for creating touching triangles representa...
Emden R. Gansner, Yifan Hu, Stephen G. Kobourov
CCGRID
2005
IEEE
15 years 5 months ago
Supporting the dynamic grid service lifecycle
This paper presents an architecture and implementation for a dynamic OGSA-based Grid service architecture that extends GT3 to support dynamic service hosting - where to host and r...
Jon B. Weissman, Seonho Kim, Darin England
FUN
2010
Springer
285views Algorithms» more  FUN 2010»
15 years 4 months ago
An Algorithmic Analysis of the Honey-Bee Game
The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a singl...
Rudolf Fleischer, Gerhard J. Woeginger
GD
2004
Springer
15 years 5 months ago
Convex Drawings of 3-Connected Plane Graphs
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah
JHSN
2006
100views more  JHSN 2006»
14 years 11 months ago
Reconfiguring Role Based Access Control policies using risk semantics
We present a refined model for Role Based Access Control policies and define a risk measure for the model, which expresses elements of the operational, combinatorial and conflict ...
Benjamin Aziz, Simon N. Foley, John Herbert, Garre...