IEICE Technical Committee Submission System
Conference Schedule		 Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 5 of 5  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2022-10-26
14:30		 Fukuoka Kyusyu Univ. Nishijin Plaza Efficient Enumeration of Spanning Subgraphs in Planar Graphs with Edge Connectivity Constraints
Yasuaki Kobayashi (Hokkaido Univ.), Kazuhiro Kurita (Nagoya Univ.), Kunihiro Wasa (Hosei Univ.) COMP2022-17		 In this paper, we address an efficient enumeration of spanning subgraphs in planar graphs with edge-connected constraint... [more] COMP2022-17
pp.21-28
COMP 2007-06-29
09:50		 Hokkaido Hokkaido University Testing k-Edge-Connectivity of Digraphs
Yuichi Yoshida, Hiro Ito (Kyoto Univ.) COMP2007-20		 In this paper, we show constant time algorithm for testing whether a given degree-bounded digraph is $k$-edge-connected ... [more] COMP2007-20
pp.17-23
COMP 2006-05-24
10:40		 Fukuoka Kyushu Institute of Technology Minimum Augmentation of Edge-Connectivity with Monotone Requirements in Undirected Graphs
Toshimasa Ishii (Otaru Univ. of Commerce) 		For a finite ground set $V$, we call a set-function $r: 2^V \rightarrow Z^+$ monotone, if $r(X')\geq r(X)$ holds for... [more] COMP2006-10
pp.1-8
CAS, SIP, CS 2006-03-07
11:45		 Okinawa Univ of Ryukyu Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three
Kenya Sugihara, Hiro Ito (Kyoto Univ.) 		Given a graph $G=(V,E)$, a set of vertices $S\subseteq V$ covers a vertex $v\in V$ if the edge-connectivity between $S$ ... [more] CAS2005-122 SIP2005-168 CS2005-115
pp.25-29
COMP 2005-03-18
15:00		 Tokyo Tokyo Institute of Technology Minimum 3-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Degree Constraints
Toshiya Mashima (Hiroshima International Univ.), Toshimasa Watanabe (Hiroshima Univ.) 		The $k$-edge-connectivity augmentation problem for a specified set of vertices of a graph with degree constraints, $k$EC... [more] COMP2004-81
pp.61-70
 Results 1 - 5 of 5  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
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]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan