Sciweavers

311 search results - page 56 / 63
» Graph Classes Between Parity and Distance-hereditary Graphs
Sort
View
CRITIS
2007
13 years 9 months ago
An Analysis of Cyclical Interdependencies in Critical Infrastructures
Abstract In this paper we discuss the properties and algorithmic methods for the identification and classification of cyclical interdependencies in critical infrastructures based...
Nils Kalstad Svendsen, Stephen D. Wolthusen
WAE
2001
281views Algorithms» more  WAE 2001»
13 years 8 months ago
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
David A. Bader, Ajith K. Illendula, Bernard M. E. ...
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 8 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
CISS
2008
IEEE
13 years 7 months ago
Detection of anomalous meetings in a social network
Abstract-- When monitoring interactions within a social network, meetings or contacts between different members of the network are recorded. This paper addresses the problem of usi...
Jorge Silva, Rebecca Willett
DM
2006
122views more  DM 2006»
13 years 7 months ago
Labeling trees with a condition at distance two
An L(h, k)-labeling of a graph G is an integer labeling of vertices of G, such that adjacent vertices have labels which differ by at least h, and vertices at distance two have lab...
Tiziana Calamoneri, Andrzej Pelc, Rossella Petresc...