Paper Abstract and Keywords |
Presentation |
2009-03-03 13:10
[Poster Presentation]
A Note on Two Problems of Nano-PLA Design Anish Man Singh Shrestha, Tomoki Yamada, Satoshi Tayu, Shuichi Ueno (Tokyo Inst of Tech) CAS2008-133 SIP2008-196 CS2008-107 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
This paper shows that the subgraph isomorphism problem is NP-hard even for bipartite permutation graphs, while the balanced complete bipartite subgraph problem can be solved in O(n + m) time for a bipartite permutation graph with n vertices and m edges. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
balanced complete bipartite subgraph / bipartite permutation graph / chordal bipartite graph / nano–PLA / NP-hard / orthogonal ray graph / polynomial-time algorithm / subgraph isomorphism |
Reference Info. |
IEICE Tech. Rep., vol. 108, no. 453, CAS2008-133, pp. 183-184, March 2009. |
Paper # |
CAS2008-133 |
Date of Issue |
2009-02-23 (CAS, SIP, CS) |
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 |
CAS2008-133 SIP2008-196 CS2008-107 |