4865 search results - page 195 / 973 » The Complexity of Graph Connectivity |
141
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the so-called miniaturization mapping is a reduction preservi...
254
click to vote
COLOGNETWENTE
2010
15 years 5 months ago
2010
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...
153
click to vote
FSEN
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
172
click to vote
ACMSE
2006
ACM
16 years 15 days ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
140
click to vote
ICSE
1995
IEEE-ACM
15 years 10 months ago
1995
IEEE-ACM
Compilers and other programming environment tools derive information from the source code of programs; derived information includes compiled code, interprocedural summary informat...