23 search results - page 1 / 5 » Parallel Algorithms for the Subgraph Homeomorphism Problem |
WADS
1989
Springer
13 years 9 months ago
1989
Springer
STOC
1991
ACM
13 years 8 months ago
1991
ACM
act We give an algorithm for imbedding a graph G of n vertices onto an oriented surface of minimal genus g. If g > 0 then we also construct a forbidden subgraph of G which is ho...
SWAT
1994
Springer
13 years 9 months ago
1994
Springer
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using today’s ubiquitou...
HPCC
2005
Springer
13 years 10 months ago
2005
Springer
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...