|
| Keyword : NP-completeness
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
|
Computational Complexity of Generalized Golf Solitaire
Chuzo IWAMOTO | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2015/03/01
Vol. E98-D
No. 3 ;
pp. 541-544
Type of Manuscript:
Special Section LETTER (Special Section on Foundations of Computer Science---New Spirits in Theory of Computation and Algorithm---)
Category:
Keyword:
computational complexity, NP-completeness, puzzle, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
|
On the Complexity of Embedding of Graphs into Grids with Minimum Congestion
Akira MATSUBAYASHI Shuichi UENO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1996/04/25
Vol. E79-A
No. 4 ;
pp. 469-476
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
NP-completeness, graph embedding, congestion, grid, VLSI layout, | | | Summary | Full Text:PDF | |
|
Is a Given Flow Uncontrollable?
Tomomi MATSUI | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1996/04/25
Vol. E79-A
No. 4 ;
pp. 448-451
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
network flow, NP-completeness, | | | Summary | Full Text:PDF | |
|
|
-Coloring Problem