1729 search results - page 197 / 346 » Bound Graph Polysemy |
163
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
171
click to vote
IPL
2008
15 years 6 months ago
2008
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
161
click to vote
ENDM
2007
15 years 6 months ago
2007
Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let Gn,p denote a random graph on n vertices with edge probab...
157
click to vote
TC
2008
15 years 6 months ago
2008
Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute in...
158
click to vote
IPL
2007
15 years 6 months ago
2007
Given an edge-weighted graph G = (V,E), a subset S ⊆ V , an integer k 1 and a real b 0, the minimum subpartition problem asks to find a family of k nonempty disjoint subsets X1...