|
| Keyword : graph
| |
| |
| |
| |
|
Revisiting the Top-Down Computation of BDD of Spanning Trees of a Graph and Its Tutte Polynomial
Farley Soares OLIVEIRA Hidefumi HIRAISHI Hiroshi IMAI | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2019/09/01
Vol. E102-A
No. 9 ;
pp. 1022-1027
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: Graph algorithms
Keyword:
BDD, Tutte polynomial, graph, pathwidth, FPT algorithm, | | | Summary | Full Text:PDF | |
| |
|
Alignment Kernels Based on a Generalization of Alignments
Kilho SHIN | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2014/01/01
Vol. E97-D
No. 1 ;
pp. 1-10
Type of Manuscript:
PAPER
Category: Fundamentals of Information Systems
Keyword:
edit distance, kernel, tree, graph, | | | Summary | Full Text:PDF | |
| |
| |
|
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 | |
|
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 | |
| |
| |
| |
| |
| |
| |
|
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 | |
|
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 | |
| |
|
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 | |
|
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 | |
| |
| |
|
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 | |
|
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 | |
| |
|
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/25
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 | |
| |
| |
| |
|
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/25
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 | |
|
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/25
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 | |
|
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/25
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 | |
| |
|
Balanced k-Coloring of Polyominos
Toshihiko TAKAHASHI | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1994/03/25
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 | |
| |
|
Properties of W-Tree
Hua-An ZHAO Wataru MAYEDA | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1992/09/25
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 | |
| |
|
|
-block
-centroid
-centrum