803 search results - page 61 / 161 » Independence in Direct-Product Graphs |
122
Voted
ICPADS
1998
IEEE
15 years 5 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
125
click to vote
PODC
2010
ACM
15 years 2 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
EOR
2010
15 years 23 days ago
2010
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
152
Voted
ACRI
2010
Springer
14 years 9 months ago
2010
Springer
This paper investigates the behaviors and the properties of a "Give and Take" cellular automaton on a graph. Using an economical metaphor, this model implements the excha...
74
Voted
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we propose a novel method for generic object localization. The method is based on modeling the object as a graph at two levels: a local substructural representation ...