Sciweavers

5606 search results - page 149 / 1122
» Randomization Techniques for Graphs.
Sort
View
OPODIS
2004
14 years 4 days ago
Comparison of Failures and Attacks on Random and Scale-Free Networks
Abstract. It appeared recently that some statistical properties of complex networks like the Internet, the World Wide Web or Peer-to-Peer systems have an important influence on the...
Jean-Loup Guillaume, Matthieu Latapy, Cléme...
CPC
2006
93views more  CPC 2006»
13 years 10 months ago
Distribution of Vertex Degree in Web-Graphs
We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process int...
Colin Cooper
ANOR
2002
110views more  ANOR 2002»
13 years 10 months ago
Tabu Search with Simple Ejection Chains for Coloring Graphs
We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical result...
José Luis González Velarde, Manuel L...
ICTAI
2006
IEEE
14 years 4 months ago
Graph Grammar Induction on Structural Data for Visual Programming
Computer programs that can be expressed in two or more dimensions are typically called visual programs. The underlying theories of visual programming languages involve graph gramm...
Keven Ates, Jacek P. Kukluk, Lawrence B. Holder, D...
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
14 years 2 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig