721 search results - page 110 / 145 » Bounds on the k-domination number of a graph |
ISAAC
2004
Springer
15 years 5 months ago
2004
Springer
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
SODA
2004
ACM
15 years 1 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
105
click to vote
MST
2002
14 years 11 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
103
click to vote
WALCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
107
click to vote
IMC
2010
ACM
14 years 9 months ago
2010
ACM
The Internet topology data collected through traceroute exploration has been extensively studied in the past. In particular, a remarkable property of the Internet, the power-law s...