Sciweavers

275 search results - page 3 / 55
» Component factors with large components in graphs
Sort
View
GG
2010
Springer
13 years 11 months ago
A Component Concept for Typed Graphs with Inheritance and Containment Structures
Model-driven development (MDD) has become a promising trend in software engineering. The model-driven development of highly complex software systems may lead to large models which ...
Stefan Jurack, Gabriele Taentzer
CPC
2007
76views more  CPC 2007»
13 years 9 months ago
A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n, p) in the critical window, that is, for p = n−1 + λn−4/...
Svante Janson, Joel Spencer
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 10 months ago
Component Evolution in General Random Intersection Graphs
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...
ICDM
2010
IEEE
158views Data Mining» more  ICDM 2010»
13 years 7 months ago
Patterns on the Connected Components of Terabyte-Scale Graphs
How do connected components evolve? What are the regularities that govern the dynamic growth process and the static snapshot of the connected components? In this work, we study pat...
U. Kang, Mary McGlohon, Leman Akoglu, Christos Fal...
ICIP
2007
IEEE
14 years 4 months ago
A Compact Image Magnification Method with Preservation of Preferential Components
Image magnification has been attracting a great deal of attention for long, and many approaches have been proposed to date. Nevertheless, bicubic interpolation is still the stand...
Akira Hirabayashi, Laurent Condat