Sciweavers

4488 search results - page 77 / 898
» Properties of NP-Complete Sets
Sort
View
DAM
2006
124views more  DAM 2006»
14 years 12 months ago
Coloring copoints of a planar point set
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...
Walter Morris
DAM
2000
101views more  DAM 2000»
14 years 11 months ago
The complexity of irredundant sets parameterized by size
An irredundant set of vertices V V in a graph G = (V; E) has the property that for every vertex u V ; N[V - {u}] is a proper subset of N[V ]. We investigate the parameterized co...
Rodney G. Downey, Michael R. Fellows, Venkatesh Ra...
ENTCS
2002
84views more  ENTCS 2002»
14 years 11 months ago
Set Types and Applications
We present pmlB, a programming language that includes primitive sets and associated operations. The language is equipped with a precise type discipline that statically captures dy...
Christian Skalka, Scott F. Smith
DM
2008
107views more  DM 2008»
14 years 10 months ago
Set maps, umbral calculus, and the chromatic polynomial
Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying pS(x + y) = TU=S pT (x)pU (y). Using umbral calculus, we give a formula for t...
Gus Wiseman
CD
2004
Springer
15 years 3 months ago
A Tailorable Environment for Assessing the Quality of Deployment Architectures in Highly Distributed Settings
Abstract. A distributed software system's deployment architecture can have a significant impact on the system's properties. These properties will depend on various system...
Marija Mikic-Rakic, Sam Malek, Nels Beckman, Nenad...