Join Our Newsletter

GC

2010

Springer

9 years 6 months ago
2010

Springer

A star-factor of a graph is a spanning subgraph each of whose components is a star. A graph

TCS

2008

9 years 7 months ago
2008

The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...

CORR

2007

Springer

9 years 7 months ago
2007

Springer

For digraphs G and H, a homomorphism of G to H is a mapping f : V (G)→V (H) such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (G) is associated ...

CORR

2007

Springer

9 years 7 months ago
2007

Springer

— This work considers the problem of transmitting multiple compressible sources over a network with minimum cost. The problem is complicated by the fact that the description of t...

ADHOC

2007

9 years 8 months ago
2007

We investigate the problem of modeling node capture attacks in heterogeneous wireless ad hoc and mesh networks. Classical adversarial models such as the Dolev–Yao model are know...

CONEXT

2008

ACM

9 years 9 months ago
2008

ACM

One of the fundamental problems in the wireless sensor networks is the coverage problem. The coverage problem fundamentally address the quality of service (surveillance or monitor...

VLDB

1991

ACM

9 years 11 months ago
1991

ACM

The development of a distributed database systemrequires effective solutions to many complex and interrelated design problems. The cost dependenciesbetween query optimization and ...

ETFA

2006

IEEE

9 years 11 months ago
2006

IEEE

Wireless sensor networks (WSN) consist of small self-contained devices with computational, sensing and wireless communication capabilities. They allow flexible, powerful, tetherles...

FOCS

2000

IEEE

10 years 8 days ago
2000

IEEE

A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...

AAIM

2008

Springer

10 years 2 months ago
2008

Springer

For digraphs D and H, a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (D) is associated with co...