1998 search results - page 266 / 400 » Complexity of the Cover Polynomial |
128
Voted
AGTIVE
2003
Springer
15 years 6 months ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
119
Voted
FSTTCS
2009
Springer
15 years 5 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
85
Voted
ECCC
2010
15 years 26 days ago
2010
Abstract--There has been a sequence of recent papers devoted to understanding the relation between the testability of properties of Boolean functions and the invariance of the prop...
115
Voted
BMCBI
2006
15 years 25 days ago
2006
Background: To infer the tree of life requires knowledge of the common characteristics of each species descended from a common ancestor as the measuring criteria and a method to c...
147
Voted
TASE
2010
IEEE
14 years 7 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...