5606 search results - page 121 / 1122 » Randomization Techniques for Graphs. |
IV
2003
IEEE
14 years 3 months ago
2003
IEEE
This paper introduces a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in...
GD
2004
Springer
14 years 3 months ago
2004
Springer
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...
PEPM
2007
ACM
14 years 4 months ago
2007
ACM
Functional Reactive Programming (frp) extends traditional functional programming with dataflow evaluation, making it possible to write interactive programs in a declarative style...
AI
2005
Springer
14 years 4 months ago
2005
Springer
In this research, a systematic study is conducted of four dimension reduction techniques for the text clustering problem, using five benchmark data sets. Of the four methods -- Ind...
RSA
2008
13 years 10 months ago
2008
: In this article, we initiate a systematic study of graph resilience. The (local) resilience of a graph G with respect to a property P measures how much one has to change G (local...