## Find a copy in the library

Finding libraries that hold this item...

## Details

Document Type: | Book |
---|---|

All Authors / Contributors: |
Sanjeev Khanna; Rajeev Motwani; F Frances Yao; Stanford University. Computer Science Department. |

OCLC Number: | 34331550 |

Notes: | Cover title. "February 1995." |

Description: | 7 pages ; 28 cm. |

Series Title: | Report (Stanford University. Computer Science Department), STAN- CS-TR-95-1545. |

Responsibility: | by Sanjeev Khanna, Rajeev Motwani and Frances F. Yao. |

### Abstract:

Abstract: "The largest common subtree problem is to find a largest tree which occurs as a common subgraph in a given collection of trees. Let n denote the number of vertices in the largest tree in the collection. We show that in the case of bounded degree trees, it is possible to achieve an approximation ratio of O(n(log log n)/log²n). For unbounded degree trees, we give an algorithm with approximation ratio O(n(log log n)²/log²n) when the trees are unlabeled. An approximation ratio of O(n(log log n)²/log²n) is also achieved for the case of labeled unbounded degree trees provided the number of distinct labels is O(log[superscript 0(1)]n)."

## Reviews

*User-contributed reviews*

Add a review and share your thoughts with other readers.
Be the first.

Add a review and share your thoughts with other readers.
Be the first.

## Tags

Add tags for "Approximation algorithms for the largest common subtree problem".
Be the first.