396 search results - page 65 / 80 » Exact Algorithms for Graph Homomorphisms |
115
Voted
PPOPP
2009
ACM
16 years 2 months ago
2009
ACM
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a key component of many applications and parallelizing runtimes. Work-stealing is ...
131
Voted
EVOW
2008
Springer
15 years 3 months ago
2008
Springer
Advances in modern technologies for measuring protein-protein interaction (PPI) has boosted research in PPI networks analysis and comparison. One of the challenging problems in com...
102
Voted
IEAAIE
2009
Springer
14 years 11 months ago
2009
Springer
In conflict-free routing a set of agents have to traverse a common infrastructure without interfering with each other. Maza and Castagna [1] showed how route plans can be repaired ...
129
Voted
SIGGRAPH
1997
ACM
15 years 5 months ago
1997
ACM
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
135
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...