4865 search results - page 405 / 973 » The Complexity of Graph Connectivity |
152
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
164
click to vote
SWAT
2004
Springer
16 years 5 days ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
145
click to vote
RECOMB
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
161
click to vote
COMPGEOM
2004
ACM
16 years 8 days ago
2004
ACM
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
182
click to vote
HPDC
2009
IEEE
16 years 1 months ago
2009
IEEE
Since the advent of electronic computing, the processors’ clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of proc...