Sciweavers

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

21

CP
2005
Springer

favoriteEmaildiscussreport

101views Artificial Intelligence» more CP 2005»

Approximate Constrained Subgraph Matching

14 years 4 months ago

Approximate Constrained Subgraph Matching

Download www.info.ucl.ac.be

Stéphane Zampelli, Yves Deville, Pierre Dup

Real-time Traffic

CP 2005 | Programming Languages |

claim paper

Related Content

» Combining Two Structured Domains for Modeling Various Graph Matching Problems

» SAPPER Subgraph Indexing and Approximate Matching in Large Graphs

» Structural Graph Matching With Polynomial Bounds On Memory and on WorstCase Effort

» Probabilistic Subgraph Matching on Huge Social Networks

» The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number

» Approximating Directed WeightedDegree Constrained Networks

» Similarity Analysis of Protein Binding Sites A Generalization of the Maximum Common Subgra...

» On TreeConstrained Matchings and Generalizations

» Continuous Subgraph Pattern Search over Graph Streams

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	CP
Authors	Stéphane Zampelli, Yves Deville, Pierre Dupont

Comments (0)