|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
QIT (2nd) |
2019-05-21 16:10 |
Fukuoka |
Kyushu University, Chikushi Campus |
Exponential-Time Quantum Algorithm for Graph Coloring Problem Kazuya Shimizu, Ryuhei Mori (TiTech) |
In this work, we show an exponential-time quantum algorithm for the graph k-coloring problem, which is one of the well-k... [more] |
|
COMP |
2008-05-13 13:55 |
Fukuoka |
Kyushu Sangyo University |
NP-Completeness of Planar n/k-Coloring Problems for n/k Between 3 and 4 Masakazu Shoji, Akihiro Uejima (Osaka Electro-Communication Univ.) COMP2008-11 |
This report considers the $n/k$-coloring problem, which is a subproblem for the $H$-coloring problem, where $H$ is a sim... [more] |
COMP2008-11 pp.25-32 |
CAS |
2008-01-31 13:50 |
Okinawa |
|
The constitution method of planar graphs existing between hierarchy structure for n/k-colorings Yuya Iguchi, Masakazu Shoji, Akihiro Uejima (Osaka Electro-Communication Univ.) CAS2007-86 |
The typical vertex n-colorings have trivial inclusion relations of classes of n-colorable graphs for the escalating numb... [more] |
CAS2007-86 pp.13-18 |
COMP |
2007-06-29 14:40 |
Hokkaido |
Hokkaido University |
On the complexity of planar n/k-coloring problems Masakazu Shoji, Akihiro Uejima (Osaka Electro-Communication Univ.) COMP2007-25 |
This paper considers the {\it $n/k$-coloring problem} ({\it Circular Coloring}), which is a
subproblem of the $H$-color... [more] |
COMP2007-25 pp.55-62 |
|
|
|
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)
|
[Return to Top Page]
[Return to IEICE Web Page]
|