Sciweavers

Share ➚
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
WG
1999
Springer
88views Theoretical Computer Science» more  WG 1999»
Finding Smallest Supertrees Under Minor Containment
12 years 10 months ago
Finding Smallest Supertrees Under Minor Containment
Download  users.uoa.gr
The diversity of application areas relying on tree-structured data results in wide interest in algorithms which determine diļ¬€erences or similarities among trees. One way of meas...
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thi...
claim paper
Read More »
CPM
2004
Springer
120views Combinatorics» more  CPM 2004»
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem
12 years 11 months ago
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem
Download  www.df.lth.se
For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) i...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
claim paper
Read More »
Explore & Download
Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
Productivity Tools
International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
Document Tools
PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
Image Tools
JPG to PS JPG to PDF Extract Images from PDF Image Converter
Sciweavers
About Community Report Bug Request Feature Cookies Privacy Policy Terms of Use Contact

Copyright © 2009-2011 Sciweavers LLC. All rights reserved.

books