|
| Keyword : graph algorithm
| |
| |
|
Power of Enumeration — Recent Topics on BDD/ZDD-Based Techniques for Discrete Structure Manipulation
Shin-ichi MINATO | Publication:
Publication Date: 2017/08/01
Vol. E100-D
No. 8 ;
pp. 1556-1562
Type of Manuscript:
INVITED PAPER (Special Section on Multiple-Valued Logic and VLSI Computing)
Category:
Keyword:
BDD, ZDD, discrete structure, graph algorithm, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
|
Computing a Minimum Cut in a Graph with Dynamic Edges Incident to a Designated Vertex
Hiroshi NAGAMOCHI | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2007/02/01
Vol. E90-D
No. 2 ;
pp. 428-431
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science)
Category: Graph Algorithms
Keyword:
dynamic graph, edge-connectivity, extreme vertex set, graph algorithm, | | | Summary | Full Text:PDF | |
|
Computational Results for Gaussian Moat Problem
Nobuyuki TSUCHIMURA | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/05/01
Vol. E88-A
No. 5 ;
pp. 1267-1273
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
graph algorithm, Gaussian prime, parallel computing, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
| |
| |
|
|
