4865 search results - page 197 / 973 » The Complexity of Graph Connectivity |
133
Voted
CORR
2010
Springer
15 years 14 days ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
132
Voted
SAS
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
118
Voted
CHI
2007
ACM
16 years 4 months ago
2007
ACM
Designing mobile and wearable applications is a challenge. The context of use is more important than ever and traditional methodologies for elicitation and specification reach the...
103
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The observation and modeling of natural Complex Systems (CSs) like the human nervous system, the evolution or the weather, allows the definition of special abilities and models re...
125
click to vote
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and ...