Sciweavers

2079 search results - page 165 / 416
» Universality of random graphs
Sort
View
CCCG
2004
15 years 8 months ago
Three-dimensional 1-bend graph drawings
We consider three-dimensional grid-drawings of graphs with at most one bend per edge. Under the additional requirement that the vertices be collinear, we prove that the minimum vo...
Pat Morin, David R. Wood
IM
2006
15 years 6 months ago
Protean Graphs
We propose a new random model of web graphs in which the degree of a vertex depends on its age. We characterize the degree sequence of this model and study its behaviour near the c...
Tomasz Luczak, Pawel Pralat
ICSE
1992
IEEE-ACM
15 years 10 months ago
The Use of Program Dependence Graphs in Software Engineering
This paper describes a language-independent program representation--the program dependence graph--and discusses how program dependence graphs, together with operations such as pro...
Susan Horwitz, Thomas W. Reps
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
15 years 4 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
BIBE
2006
IEEE
160views Bioinformatics» more  BIBE 2006»
16 years 17 days ago
Methods for Random Modularization of Biological Networks
— Biological networks are formalized summaries of our knowledge about interactions among biological system components, like genes, proteins, or metabolites. From their global top...
Zachary M. Saul, Vladimir Filkov