3204 search results - page 275 / 641 » The b-chromatic Number of a Graph |
92
Voted
APPROX
2004
Springer
15 years 6 months ago
2004
Springer
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
122
Voted
ECBS
2002
IEEE
15 years 5 months ago
2002
IEEE
This paper discusses an approach for top-down composition of software architectures. First, an architecture is derived that addresses functional requirements only. This architectu...
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...
SPAA
2000
ACM
15 years 5 months ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
SOFSEM
1997
Springer
15 years 5 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...