Keyword List
Japanese Page
SITE TOP
Login
To browse Full-Text PDF.
>
Forgotten your password?
Menu
Search
Full-Text Search
Search(JPN)
Latest Issue
A Fundamentals
Trans.Fundamentals.
JPN Edition(in Japanese)
B Communications
Trans.Commun.
JPN Edition(in Japanese)
C Electronics
Trans.Electron.
JPN Edition(in Japanese)
D Information & Systems
Trans.Inf.&Syst.
JPN Edition(in Japanese)
Abstracts of JPN Edition
Trans.Fundamentals.
Trans.Commun.
Trans.Electron.
Trans.Inf.&Syst.
Archive
Volume List
Trans.Fundamentals.
Trans.Commun.
Trans.Electron.
Trans.Inf.&Syst.
Transactions (1976-1990)
Volume List [JPN Edition]
A JPN Edition(in Japanese)
B JPN Edition(in Japanese)
C JPN Edition(in Japanese)
D JPN Edition(in Japanese)
Editorial Board & Reviewers
Open Access Papers
Trans. Commun.
Trans. Commun.(JPN Edition)
Link
Subscription
Join IEICE
Library/Nonmember
Pay Per View
A Fundamentals
B Communications
C Electronics
D Information & Systems
For Authors
IEICE Home Page
Citation Index
Privacy Policy
Copyright & Permissions
Copyright (c) by IEICE
Keyword : edge-connectivity of a specified set of vertices
On Minimum
k
-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree
Toshiya MASHIMA
Satoshi TAOKA
Toshimasa WATANABE
Publication:
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date:
2006/04/01
Vol.
E89-A
No.
4
pp.
1042-1048
Type of Manuscript:
Special Section PAPER (Special Section on Selected Papers from the 18th Workshop on Circuits and Systems in Karuizawa)
Category:
Keyword:
graphs
,
edge-connectivity of a specified set of vertices
,
augmentation problems
,
degree constraints
,
linear time algorithms
,
Summary
|
Full Text:PDF
(325.4KB)