Sciweavers

650 search results - page 31 / 130
» Positive graphs
Sort
View
GRAPHICSINTERFACE
2011
14 years 1 months ago
Improving revisitation in graphs through static spatial features
People generally remember locations in visual spaces with respect to spatial features and landmarks. Geographical maps provide many spatial features and hence are easy to remember...
Sohaib Ghani, Niklas Elmqvist
ACSC
2007
IEEE
15 years 4 months ago
From Graphs to Euclidean Virtual Worlds: Visualization of 3D Electronic Institutions
In this paper we propose an algorithm for automatic transformation of a graph into a 3D Virtual World and its Euclidean map, using the rectangular dualization technique. The nodes...
Sara Drago, Anton Bogdanovych, Massimo Ancona, Sim...
AGTIVE
1999
Springer
15 years 2 months ago
Graph Algorithm Animation with Grrr
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming l...
Peter J. Rodgers, Natalia Vidal
JCT
2010
127views more  JCT 2010»
14 years 4 months ago
On the density of a graph and its blowup
It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...
Asaf Shapira, Raphael Yuster
FSTTCS
2010
Springer
14 years 7 months ago
The effect of girth on the kernelization complexity of Connected Dominating Set
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
Neeldhara Misra, Geevarghese Philip, Venkatesh Ram...