3396 search results - page 382 / 680 » Tree representations of graphs |
183
Voted
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
199
click to vote
ALMOB
2006
15 years 6 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
222
click to vote
ICDE
2009
IEEE
15 years 4 months ago
2009
IEEE
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...
186
click to vote
COMPGEOM
2003
ACM
15 years 12 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
173
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
Memory leaks are caused by software programs that prevent the reclamation of memory that is no longer in use. They can cause significant slowdowns, exhaustion of available storag...