Sciweavers

3757 search results - page 102 / 752
» The overlap number of a graph
Sort
View
JGAA
2008
100views more  JGAA 2008»
14 years 10 months ago
Parameters of Bar k-Visibility Graphs
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...
Stefan Felsner, Mareike Massow
ICMI
2007
Springer
92views Biometrics» more  ICMI 2007»
15 years 4 months ago
A study on the scalability of non-preferred hand mode manipulation
In pen-tablet input devices modes allow overloading of the electronic stylus. In the case of two modes, switching modes with the non-preferred hand is most effective [12]. Furthe...
Jaime Ruiz, Edward Lank
GG
2004
Springer
15 years 3 months ago
Embedding in Switching Classes with Skew Gains
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Gr...
CPC
1998
64views more  CPC 1998»
14 years 9 months ago
Isoperimetric Inequalities for Cartesian Products of Graphs
We give a characterization for isoperimetric invariants, including the Cheeger constant and the isoperimetric number of a graph. This leads to an isoperimetric inequality for the ...
Fan R. K. Chung, Prasad Tetali
COMGEO
2007
ACM
14 years 10 months ago
Graph drawings with few slopes
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
Vida Dujmovic, Matthew Suderman, David R. Wood