356 search results - page 62 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
193
click to vote
SIGMOD
2008
ACM
16 years 14 days ago
2008
ACM
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
101
Voted
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
115
click to vote
ISAAC
2004
Springer
15 years 5 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
106
click to vote
STOC
2003
ACM
16 years 19 days ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
115
click to vote
BMCBI
2006
15 years 11 days ago
2006
Background: The problem of inferring the evolutionary history and constructing the phylogenetic tree with high performance has become one of the major problems in computational bi...