|
|
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 # |
COMP |
2010-04-22 10:00 |
Shiga |
Ritusmeikan University, Biwako-Kusatsu Campus |
A tight upper bound on the (2,1)-total labeling number of outerplanar graphs Toru Hasunuma (Univ. Tokushima), Toshimasa Ishii (Otaru Univ. Commerce), Hirotaka Ono (Kyushu Univ.), Yushi Uno (Osaka Pref. Univ.) COMP2010-1 |
A $(2,1)$-total labeling of a graph $G$ is an assignment $f$
from the vertex set $V(G)$ and the edge set $E(G)$
to t... [more] |
COMP2010-1 pp.1-8 |
SIP, CAS, CS |
2010-03-01 11:30 |
Okinawa |
Hotel Breeze Bay Marina, Miyakojima |
Highly connected k-tuple twin dominating sets in iterated line digraphs Toru Hasunuma, Mayu Otani (Univ. of Tokushima) CAS2009-89 SIP2009-134 CS2009-84 |
[more] |
CAS2009-89 SIP2009-134 CS2009-84 pp.65-68 |
COMP |
2008-05-13 15:55 |
Fukuoka |
Kyushu Sangyo University |
An O(n^{1.75})-time Algorithm for L(2,1)-labeling of Trees Toru Hasunuma (Univ. Tokushima), Toshimasa Ishii (Otaru Univ. of Commerce), Hirotaka Ono (Kyushu Univ.), Yushi Uno (Osaka Prefecture Univ.) COMP2008-14 |
An $L(2,1)$-labeling of a graph $G$ is an assignment $f$
from the vertex set $V(G)$ to the set of nonnegative integers... [more] |
COMP2008-14 pp.43-50 |
|
|
|
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]
|