1477 search results - page 4 / 296 » On Graph Problems in a Semi-streaming Model |
SIAMCOMP
1998
14 years 9 months ago
1998
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
GG
2008
Springer
14 years 10 months ago
2008
Springer
We consider four different models of process interactions that unify and generalise models introduced and studied by Angluin et al. [AAD+ 04] and models introduced and studied by ...
JCO
2007
14 years 9 months ago
2007
This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relat...
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. Consider for an even d 4, a random d-regular graph model formed from d/2 uniform, independent permutat...