1729 search results - page 218 / 346 » On Bounds for the k-Partitioning of Graphs |
183
click to vote
CPC
2007
15 years 6 months ago
2007
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
187
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
Abstract. Embedded multimedia systems often run multiple time-constrained applications simultaneously. These systems use multiprocessor systems-on-chip of which it must be guarante...
164
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
140
click to vote
MFCS
2009
Springer
16 years 28 days ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
205
click to vote
AAIM
2007
Springer
16 years 17 days ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...