9532 search results - page 89 / 1907 » Logic, Graphs, and Algorithms |
113
click to vote
APPROX
2005
Springer
15 years 4 months ago
2005
Springer
We introduce a “derandomized” analogue of graph squaring. This operation increases the connectivity of the graph (as measured by the second eigenvalue) almost as well as squar...
123
click to vote
FAW
2010
Springer
14 years 9 months ago
2010
Springer
In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several grap...
123
click to vote
ISAAC
2010
Springer
14 years 9 months ago
2010
Springer
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...
SRDS
2005
IEEE
15 years 4 months ago
2005
IEEE
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
102
click to vote
COCOA
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...