4171 search results - page 355 / 835 » Choice numbers of graphs |
179
click to vote
MFCS
2005
Springer
16 years 13 days ago
2005
Springer
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea...
176
click to vote
APPROX
2004
Springer
16 years 10 days 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...
198
click to vote
ECBS
2002
IEEE
15 years 12 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...
190
click to vote
IPPS
2002
IEEE
15 years 12 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...
159
click to vote
SPAA
2000
ACM
15 years 11 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...