1729 search results - page 197 / 346 » On Bounds for the k-Partitioning of Graphs |
166
click to vote
SIROCCO
2007
15 years 7 months ago
2007
Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consulting the labels given to any t...
166
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
155
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
162
click to vote
WG
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...
154
click to vote
WG
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...