|
| Keyword : graphs
| |
| |
| |
| |
|
Some Reduction Procedure for Computing Pathwidth of Undirected Graphs
Masataka IKEDA Hiroshi NAGAMOCHI | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2015/03/01
Vol. E98-D
No. 3 ;
pp. 503-511
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science---New Spirits in Theory of Computation and Algorithm---)
Category:
Keyword:
pathwidth, exact algorithms, graphs, chemical graphs, | | | Summary | Full Text:PDF | |
| |
| |
|
Coding Floorplans with Fewer Bits
Katsuhisa YAMANAKA Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/05/01
Vol. E89-A
No. 5 ;
pp. 1181-1185
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
graphs, algorithms, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
| |
| |
| |
|
Counting the Number of Paths in a Graph via BDDs
Kyoko SEKINE Hiroshi IMAI | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/04/25
Vol. E80-A
No. 4 ;
pp. 682-688
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
graphs, paths, #P-complete, BDD, | | | Summary | Full Text:PDF | |
| |
| |
| |
|
|