Sciweavers

3265 search results - page 151 / 653
» Representing Groups on Graphs
Sort
View
DM
2007
125views more  DM 2007»
15 years 4 months ago
Generalized switch-setting problems
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
Torsten Muetze
IV
2002
IEEE
121views Visualization» more  IV 2002»
15 years 9 months ago
Visualising a Fund Manager Flow Graph with Columns and Worms
This paper describes a paradigm for visualising time deflow in a network of objects connected by abstract relationships (a graph) by representing time in the third dimension. We ...
Tim Dwyer, Peter Eades
BIRTHDAY
2008
Springer
15 years 6 months ago
Unfolding Graph Transformation Systems: Theory and Applications to Verification
The unfolding of a system represents in a single branching structure all its possible computations: it is the cornerstone both of semantical constructions and of efficient partial ...
Paolo Baldan, Andrea Corradini, Barbara König
WG
2010
Springer
15 years 2 months ago
Graphs that Admit Right Angle Crossing Drawings
We consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. We show that if a ...
Karin Arikushi, Radoslav Fulek, Balázs Kesz...
CORR
2011
Springer
174views Education» more  CORR 2011»
14 years 11 months ago
Lower bounds on the obstacle number of graphs
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...
Padmini Mukkamala, János Pach, Döm&oum...