IEICE SEARCH SYSTEM

Keyword : graph

Listing All st-Orientations Andry SETIAWAN Shin-ichi NAKANO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2011/10/01 Vol. E94-A No. 10 pp. 1965-1970 Type of Manuscript: PAPER Category: Algorithms and Data Structures Keyword: graph, st-orientation, enumeration,
	Summary \| Full Text:PDF (625.4KB)

A Simple Canonical Code for Fullerene Graphs Naoki SHIMOTSUMA Shin-ichi NAKANO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2009/12/01 Vol. E92-A No. 12 pp. 3398-3400 Type of Manuscript: LETTER Category: Algorithms and Data Structures Keyword: graph, algorithm,
	Summary \| Full Text:PDF (245.2KB)

A Compact Encoding of Rectangular Drawings with Efficient Query Supports Katsuhisa YAMANAKA Shin-ichi NAKANO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2008/09/01 Vol. E91-A No. 9 pp. 2284-2291 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: graph, algorithm, graph encoding, rectangular drawing, query supports,
	Summary \| Full Text:PDF (273.5KB)

XML Framework for Various Types of Decision Diagrams for Discrete Functions Stanislav STANKOVIC Jaakko ASTOLA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2007/11/01 Vol. E90-D No. 11 pp. 1731-1740 Type of Manuscript: PAPER Category: Contents Technology and Web Information Systems Keyword: decision diagrams, XML, graph, data structures, logic design,
	Summary \| Full Text:PDF (867.7KB)

A Fast Edge-Splitting Algorithm in Edge-Weighted Graphs Hiroshi NAGAMOCHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/05/01 Vol. E89-A No. 5 pp. 1263-1268 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: algorithm, connectivity augmentation, edge-connectivity, edge-splitting, extreme vertex sets, graph,
	Summary \| Full Text:PDF (167.4KB)

Maximum-Cover Source-Location Problems Kenya SUGIHARA Hiro ITO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/05/01 Vol. E89-A No. 5 pp. 1370-1377 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: graph, edge-connectivity, location problem, polynomial-time algorithm, NP-hard,
	Summary \| Full Text:PDF (289.4KB)

Increasing the Edge-Connectivity by Contracting a Vertex Subset in Graphs Hiroshi NAGAMOCHI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2006/02/01 Vol. E89-D No. 2 pp. 744-750 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science) Category: Graph Algorithm Keyword: algorithm, edge-connectivity, extreme vertex sets, graph, source location problem,
	Summary \| Full Text:PDF (534.1KB)

Placement of Vertex Labels in a Graph Drawing Noboru ABE Sumio MASUDA Kazuaki YAMAGUCHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2004/10/01 Vol. E87-A No. 10 pp. 2774-2779 Type of Manuscript: PAPER Category: Graphs and Networks Keyword: graph, drawing, labeling, algorithm, matching,
	Summary \| Full Text:PDF (345.8KB)

Distance between Rooted and Unordered Trees Based on Vertex and Edge Mappings Shaoming LIU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2004/05/01 Vol. E87-A No. 5 pp. 1034-1041 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: tree, graph, structure, pattern, distance, similarity, mapping, algorithm, pattern matching,
	Summary \| Full Text:PDF (275.1KB)

Efficient Generation of Plane Triangulations with Specified Maximum Degree Hiroyuki TANAKA Shin-ichi NAKANO
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2004/02/01 Vol. E87-D No. 2 pp. 330-336 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science) Category: Keyword: graph, algorithm, plane graph, generation,
	Summary \| Full Text:PDF (314.2KB)

Trade-Offs in Custom Circuit Designs for Subgraph Isomorphism Problems Shuichi ICHIKAWA Hidemitsu SAITO Lerdtanaseangtham UDORN Kouji KONISHI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2003/07/01 Vol. E86-D No. 7 pp. 1250-1257 Type of Manuscript: PAPER Category: VLSI Systems Keyword: NP-complete, graph, algorithm, FPGA,
	Summary \| Full Text:PDF (328KB)

Transitive Signature Scheme for Directed Trees Hidenori KUWAKADO Hatsukazu TANAKA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2003/05/01 Vol. E86-A No. 5 pp. 1120-1126 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: transitive signature, fail-stop signature, tree, graph,
	Summary \| Full Text:PDF (224.1KB)

Efficient Generation of Plane Triangulations with a Degree Constraint Hiroyuki TANAKA Zhangjian LI Shin-ichi NAKANO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2003/04/01 Vol. E86-A No. 4 pp. 829-834 Type of Manuscript: Special Section PAPER (Special Section of Selected Papers from the 15th Workshop on Circuits and Systems in Karuizawa) Category: Keyword: graph, algorithm, plane graph, generation,
	Summary \| Full Text:PDF (274.1KB)

Constructing a Cactus for Minimum Cuts of a Graph in O(mn+n²log n) Time and O(m) Space Hiroshi NAGAMOCHI Shuji NAKAMURA Toshimasa ISHII
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2003/02/01 Vol. E86-D No. 2 pp. 179-185 Type of Manuscript: Special Section PAPER (Special Issue on Selected Papers from LA Symposium) Category: Graph Algorithms Keyword: graph, minimum cut, algorithm, cactus, maximum adjacency ordering, connectivity, maximum flow,
	Summary \| Full Text:PDF (282.3KB)

A Note on Approximating the Survivable Network Design Problem in Hypergraphs Liang ZHAO Hiroshi NAGAMOCHI Toshihide IBARAKI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2002/02/01 Vol. E85-D No. 2 pp. 322-326 Type of Manuscript: Special Section PAPER (Special Issue on Selected Papers from LA Symposium) Category: Keyword: survivable network design problem, approximation algorithm, connectivity, graph, hypergraph,
	Summary \| Full Text:PDF (371.8KB)

A Linear-Time Algorithm for Five-Partitioning Five-Connected Internally Triangulated Plane Graphs Sayaka NAGAI Shin-ichi NAKANO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2001/09/01 Vol. E84-A No. 9 pp. 2330-2337 Type of Manuscript: PAPER Category: Algorithms and Data Structures Keyword: graph, algorithm, partition,
	Summary \| Full Text:PDF (764.2KB)

A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs Sayaka NAGAI Shin-ichi NAKANO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2001/05/01 Vol. E84-A No. 5 pp. 1102-1109 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: graph, algorithm, independent spanning trees,
	Summary \| Full Text:PDF (537.7KB)

Graph Augmentation Problems with Degree-Unchangeable Vertices Toshiya MASHIMA Toshimasa WATANABE
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2001/03/01 Vol. E84-A No. 3 pp. 781-793 Type of Manuscript: Special Section PAPER (Special Section of Selected Papers from the 13th Workshop on Circuits and Systems in Karuizawa) Category: Keyword: graph, connectivity augmentation, vertex-connectivity, degree-unchangeable vertices, polynomial time algorithms,
	Summary \| Full Text:PDF (651KB)

On a Relation between -Centroid and -Blocks in a Graph Masashi TAKEUCHI Shoji SOEJIMA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2000/10/20 Vol. E83-A No. 10 pp. 2009-2014 Type of Manuscript: PAPER Category: Graphs and Networks Keyword: graph, distance, -block, -centroid, -centrum,
	Summary \| Full Text:PDF (389KB)

A Faster and Flexible Algorithm for a Location Problem on Undirected Flow Networks Hiro ITO Hideyuki UEHARA Mitsuo YOKOYAMA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2000/04/20 Vol. E83-A No. 4 pp. 704-712 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: graph, network flow, location problem, node subset, polynomial time, algorithm,
	Summary \| Full Text:PDF (562.3KB)

A Simple Proof of a Minimum Cut Algorithm and Its Applications Hiroshi NAGAMOCHI Toshimasa ISHII Toshihide IBARAKI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1999/10/20 Vol. E82-A No. 10 pp. 2231-2236 Type of Manuscript: PAPER Category: Algorithms and Data Structures Keyword: graph, edge-connectivity, minimum cut, flow, MA-ordering, dynamic tree structure,
	Summary \| Full Text:PDF (409.5KB)

Sparse Spanning Subgraphs Preserving Connectivity and Distance between Vertices and Vertex Subsets Hiroyoshi MIWA Hiro ITO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1998/05/20 Vol. E81-A No. 5 pp. 832-841 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: graph, area graph, diameter, distance, connectivity, NP-complete, polynomial time, algorithm,
	Summary \| Full Text:PDF (823.5KB)

A Linear-Time Algorithm for Determining the Order of Moving Products in Realloction Problems Hiroyoshi MIWA Hiro ITO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1997/03/20 Vol. E80-A No. 3 pp. 534-543 Type of Manuscript: Special Section PAPER (Special Section of Selected Papers from the 9th Karuizawa Workshop on Circuits and Systems) Category: Keyword: graph, reallocation, linear-time, NP-complete,
	Summary \| Full Text:PDF (818.4KB)

Complexity and Algorithm for Reallocation Problem Hiroyoshi MIWA Hiro ITO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1996/04/20 Vol. E79-A No. 4 pp. 461-468 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: reallocation, graph, linear time, NP-complete,
	Summary \| Full Text:PDF (726KB)

Connectivity Problems on Area Graphs for Locally Striking Disasters--Direct NA-Connection-- Hiro ITO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1995/03/20 Vol. E78-A No. 3 pp. 363-370 Type of Manuscript: Special Section PAPER (Special Section of Selected Papers from the 7th Karuizawa Workshop on Circuits and Systems) Category: Graphs and Networks Keyword: telecommunication network, graph, connectivity, disaster, area,
	Summary \| Full Text:PDF (629.9KB)

The Distances between Unrooted and Cyclically Ordered Trees and Their Computing Methods Shaoming LIU Eiichi TANAKA Sumio MASUDA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1994/10/20 Vol. E77-D No. 10 pp. 1094-1105 Type of Manuscript: PAPER Category: Algorithm and Computational Complexity Keyword: tree, graph, distance, similarity, algorithm, pattern matching,
	Summary \| Full Text:PDF (873.3KB)

Balanced k-Coloring of Polyominos Toshihiko TAKAHASHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1994/03/20 Vol. E77-A No. 3 pp. 517-520 Type of Manuscript: Special Section PAPER (Special Section on the 6th Karuizawa Workshop on Circuits and Systems) Category: Algorithms, Data Structure and Computational Complexity Keyword: polyomino, graph, coloring, balanced coloring,
	Summary \| Full Text:PDF (240.6KB)

Graphical Degree Sequence Problems Masaya TAKAHASHI Keiko IMAI Takao ASANO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1994/03/20 Vol. E77-A No. 3 pp. 546-552 Type of Manuscript: PAPER Category: Graphs, Networks and Matroids Keyword: algorithm, degree sequence, graph, efficiency, matching,
	Summary \| Full Text:PDF (626.9KB)

Properties of W-Tree Hua-An ZHAO Wataru MAYEDA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1992/09/20 Vol. E75-A No. 9 pp. 1141-1147 Type of Manuscript: PAPER Category: Graphs, Networks and Matroids Keyword: graph, tree, W-graph, W-tree,
	Summary \| Full Text:PDF (496.2KB)

A Linear-Time Algorithm for Designing an Optimal File Transfer through an Arborescence-Net Yoshihiro KANEKO Reiko TASHIRO Shoji SHINODA Kazuo HORIUCHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1992/07/20 Vol. E75-A No. 7 pp. 901-904 Type of Manuscript: Special Section LETTER (Special Section on the 1992 IEICE Spring Conference) Category: Keyword: graph, arborescence, vertex demand, vertex cost, arc cost,
	Summary \| Full Text:PDF (260.6KB)