Sciweavers

275 search results - page 6 / 55
» Component factors with large components in graphs
Sort
View
80
Voted
DBPL
1999
Springer
125views Database» more  DBPL 1999»
15 years 1 months ago
An Overview of Souk Nets: A Component-Based Paradigm for Data Source Integration
Construction of complex software systems with largely off-the-shelf components has become a reality with the wide availability and acceptance of component frameworks and distribut...
William J. McIver Jr., Karim Keddara, Christian Oc...
DEDS
2002
106views more  DEDS 2002»
14 years 9 months ago
Efficient Computation and Representation of Large Reachability Sets for Composed Automata
We propose an approach that integrates and extends known techniques from different areas to handle and analyze a complex and large system described as a network of synchronized com...
Peter Buchholz, Peter Kemper
SIGSOFT
2005
ACM
15 years 3 months ago
Reuse and variability in large software applications
Reuse has always been a major goal in software engineering, since it promises large gains in productivity, quality and time to market reduction. Practical experience has shown tha...
Jacky Estublier, Germán Vega
101
Voted
EDBT
2012
ACM
228views Database» more  EDBT 2012»
12 years 12 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...
ICDE
2012
IEEE
232views Database» more  ICDE 2012»
12 years 12 months ago
Horton: Online Query Execution Engine for Large Distributed Graphs
—Large graphs are used in many applications, such as social networking. The management of these graphs poses new challenges because such graphs are too large to fit on a single ...
Mohamed Sarwat, Sameh Elnikety, Yuxiong He, Gabrie...