895 search results - page 72 / 179 » Using graphs for some discrete tomography problems |
119
click to vote
DISOPT
2008
15 years 3 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
129
click to vote
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
130
click to vote
AAIM
2005
Springer
15 years 8 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
107
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
102
click to vote
COR
2006
15 years 3 months ago
2006
We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to...