Sciweavers

3757 search results - page 93 / 752
» The overlap number of a graph
Sort
View
CHI
2008
ACM
15 years 10 months ago
Wedge: clutter-free visualization of off-screen locations
To overcome display limitations of small-screen devices, researchers have proposed techniques that point users to objects located off-screen. Arrow-based techniques such as City L...
Sean Gustafson, Patrick Baudisch, Carl Gutwin, Pou...
IVS
2010
44views more  IVS 2010»
14 years 4 months ago
Generalized scatter plots
Scatter Plots are one of the most powerful and most widely used techniques for visual data exploration. A well-known problem is that scatter plots often have a high degree of overl...
Daniel A. Keim, Ming C. Hao, Umeshwar Dayal, Halld...
GC
2007
Springer
14 years 10 months ago
Precoloring Extension of Co-Meyniel Graphs
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
Vincent Jost, Benjamin Lévêque, Fr&ea...
CORR
2010
Springer
198views Education» more  CORR 2010»
14 years 6 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...
CORR
2007
Springer
177views Education» more  CORR 2007»
14 years 10 months ago
Another Proof of Wright's Inequalities
We present a short way of proving the inequalities obtained by Wright in [Journal of Graph Theory, 4: 393 – 407 (1980)] concerning the number of connected graphs with ℓ edges m...
Vlady Ravelomanana