skip to content
Approximation algorithms for the largest common subtree problem Preview this item
ClosePreview this item
Checking...

Approximation algorithms for the largest common subtree problem

Author: Sanjeev Khanna; Rajeev Motwani; F Frances Yao; Stanford University. Computer Science Department.
Publisher: Stanford, Calif. : Stanford University, Dept. of Computer Science, [1995]
Series: Report (Stanford University. Computer Science Department), STAN- CS-TR-95-1545.
Edition/Format:   Book : English
Database:WorldCat
Summary:
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; 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
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/34331550>
library:oclcnum"34331550"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/34331550>
rdf:typeschema:Book
schema:about
schema:about
schema:contributor
<http://viaf.org/viaf/239748731>
rdf:typeschema:Organization
schema:name"Stanford University. Computer Science Department."
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1995"
schema:description"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).""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/158444204>
schema:inLanguage"en"
schema:name"Approximation algorithms for the largest common subtree problem"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.