Sciweavers

26 search results - page 4 / 6
» dam 1999
Sort
View
CGA
1999
13 years 7 months ago
Human-Centered Computing, Online Communities, and Virtual Environments
Judith R. Brown, Andy van Dam, Rae A. Earnshaw, Jo...
DAM
1999
88views more  DAM 1999»
13 years 7 months ago
Separable Partitions
An ordered partition of a set of n points in the d dimensional Euclidean space is called a separable partition if the convex hulls of the parts are pairwise disjoint. For each fix...
Noga Alon, Shmuel Onn
DAM
1999
119views more  DAM 1999»
13 years 7 months ago
On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
David Manlove
DAM
1999
99views more  DAM 1999»
13 years 7 months ago
Recognizing Graphs of Acyclic Cubical Complexes
Acyclic cubical complexes have first been introduced by Bandelt and Chepoi in analogy to acyclic simplicial complexes. They characterized them by cube contraction and elimination ...
Wilfried Imrich, Sandi Klavzar
DAM
1999
105views more  DAM 1999»
13 years 7 months ago
The b-chromatic Number of a Graph
The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...
Robert W. Irving, David Manlove