|
| Keyword : exact algorithms
| |
|
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 | |
|
Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3
Mingyu XIAO Hiroshi NAGAMOCHI | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2013/03/01
Vol. E96-D
No. 3 ;
pp. 408-418
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science — New Trends in Algorithms and Theory of Computation —)
Category:
Keyword:
edge dominating sets, exact algorithms, cubic graphs, | | | Summary | Full Text:PDF | |
|
|
