275 search results - page 20 / 55 » Component factors with large components in graphs |
SPAA
2004
ACM
15 years 5 months ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
117
click to vote
PDC
2004
ACM
15 years 5 months ago
2004
ACM
Most experiments with participative design are with small scale, stand alone and not very strategic applications of ICT in organizations. However, modern ICT applications are incr...
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
Genetic algorithms (GAs) have long been used for large join query optimization (LJQO). Previous work takes all queries as based on one granularity to optimize GAs and compares the...
117
click to vote
SIGIR
2008
ACM
14 years 11 months ago
2008
ACM
Motivated by our work with political scientists who need to manually analyze large Web archives of news sites, we present SpotSigs, a new algorithm for extracting and matching sig...