Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

50

WADS
1989
Springer

favoriteEmaildiscussreport

62views Algorithms» more WADS 1989»

Parallel Algorithms for the Subgraph Homeomorphism Problem

15 years 1 months ago

Parallel Algorithms for the Subgraph Homeomorphism Problem

Download www.cs.umd.edu

Samir Khuller

Real-time Traffic

Algorithms | WADS 1989 |

claim paper

Related Content

» An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgr...

» Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial kTrees

» Parallel Graphcuts by Adaptive Bottomup Merging

» High Performance Subgraph Mining in Molecular Compounds

» The ParMol Package for Frequent Subgraph Mining

» Estimation in Gaussian Graphical Models Using Tractable Subgraphs A WalkSum Analysis

» Approximation of RNA Multiple Structural Alignment

» Fast Alignments of Metabolic Networks

» Large scale complex network analysis using the hybrid combination of a MapReduce cluster a...

Post Info
More Details (n/a)

Added	11 Aug 2010
Updated	11 Aug 2010
Type	Conference
Year	1989
Where	WADS
Authors	Samir Khuller

Comments (0)