| IEICE Technical Committee Submission System Conference Paper's Information |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top Page | Go Previous | [Japanese] / [English] |
| Paper Abstract and Keywords | ||
| Presentation | 2016-11-25 09:50 On the Complexity of Finding a Largest Common Subtree of Trees Hiroki Katsumata, Satoshi Tayu, Shuichi Ueno (Tokyo Tech)  CAS2016-70 MSS2016-50 |
|
| Abstract | (in Japanese) | (See Japanese page) |
| (in English) | The largest common subtree problem (LCST) is to find a tree with the maximum number of edges that is a subtree of all the input $N$ trees. It has been known that LCST can be solved in polynomial time if $N=2$, while LCST is NP-hard if $N>2$. The paper shows that LCST is NP-hard even if $N>2$ and the pathwidth of every input tree is one. We also show that LCST is NP-hard even if $N=3$ and the pathwidth of every input tree is two, while LCST is solvable in polynomial time if $N=O(1)$ and the pathwidth of every input tree is one. |
|
| Keyword | (in Japanese) | (See Japanese page) |
| (in English) | caterpillar / common subtree / NP-hard / pathwidth / polynomial time algorithm / tree / / | |
| Reference Info. | IEICE Tech. Rep., vol. 116, no. 315, CAS2016-70, pp. 89-92, Nov. 2016. | |
| Paper # | CAS2016-70 | |
| Date of Issue | 2016-11-17 (CAS, MSS) | |
| ISSN | Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 | |
| Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) | |
| Download PDF | CAS2016-70 MSS2016-50 |
|
| Conference Information | |
| Committee | MSS CAS IPSJ-AL |
| Conference Date | 2016-11-24 - 2016-11-25 |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Kobe Institute of Computing |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Paper Information | |
| Registration To | CAS |
| Conference Code | 2016-11-MSS-CAS-AL |
| Language | English |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | On the Complexity of Finding a Largest Common Subtree of Trees |
| Sub Title (in English) | |
| Keyword(1) | caterpillar |
| Keyword(2) | common subtree |
| Keyword(3) | NP-hard |
| Keyword(4) | pathwidth |
| Keyword(5) | polynomial time algorithm |
| Keyword(6) | tree |
| Keyword(7) | |
| Keyword(8) | |
| 1st Author's Name | Hiroki Katsumata |
| 1st Author's Affiliation | Tokyo Institute of Technology (Tokyo Tech) |
| 2nd Author's Name | Satoshi Tayu |
| 2nd Author's Affiliation | Tokyo Institute of Technology (Tokyo Tech) |
| 3rd Author's Name | Shuichi Ueno |
| 3rd Author's Affiliation | Tokyo Institute of Technology (Tokyo Tech) |
| 4th Author's Name | |
| 4th Author's Affiliation | () |
| 5th Author's Name | |
| 5th Author's Affiliation | () |
| 6th Author's Name | |
| 6th Author's Affiliation | () |
| 7th Author's Name | |
| 7th Author's Affiliation | () |
| 8th Author's Name | |
| 8th Author's Affiliation | () |
| 9th Author's Name | |
| 9th Author's Affiliation | () |
| 10th Author's Name | |
| 10th Author's Affiliation | () |
| 11th Author's Name | |
| 11th Author's Affiliation | () |
| 12th Author's Name | |
| 12th Author's Affiliation | () |
| 13th Author's Name | |
| 13th Author's Affiliation | () |
| 14th Author's Name | |
| 14th Author's Affiliation | () |
| 15th Author's Name | |
| 15th Author's Affiliation | () |
| 16th Author's Name | |
| 16th Author's Affiliation | () |
| 17th Author's Name | |
| 17th Author's Affiliation | () |
| 18th Author's Name | |
| 18th Author's Affiliation | () |
| Speaker | Author-1 |
| Date Time | 2016-11-25 09:50:00 |
| Presentation Time | 25 minutes |
| Registration for | CAS |
| Paper # | CAS2016-70, MSS2016-50 |
| Volume (vol) | vol.116 |
| Number (no) | no.315(CAS), no.316(MSS) |
| Page | pp.89-92 |
| #Pages | 4 |
| Date of Issue | 2016-11-17 (CAS, MSS) |
[Return to Top Page]