1395 search results - page 170 / 279 » (k, )-Distance-Hereditary Graphs |
WER
2007
Springer
15 years 4 months ago
2007
Springer
Complex information systems have numerous design variables that are systematically decided upon during the design process. In high-variability systems, some of these decisions are...
GD
2005
Springer
15 years 3 months ago
2005
Springer
We give a drawing of Kn in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounde...
ICTCS
2005
Springer
15 years 3 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
DMCS
2003
14 years 11 months ago
2003
d Abstract) Anah´ı Gajardo† GI2MA, Departamento de Ingenier´ıa Matem´atica, Universidad de Concepci´on, Casilla 160-C, correo 3, Concepci´on, Chile The Langton’s ant is ...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...