期刊文献+

数码照片立等可取——佳能SELPHY CP730热升华照片打印机

原文传递
导出
摘要 提到热升华照片打印机,很多人都会想到佳能SELPHY CP710,而今天走进PC World中国实验室的正是CP710的升级产品——CP730。
作者 刘东明
出处 《微电脑世界》 2006年第12期64-64,共1页 PC World China
  • 相关文献

参考文献2

二级参考文献9

  • 1F P Tsen, T Y Sung, M Y Lin, et al. Finding the most vital edges with respect to the number of spanning trees [ J ]. IEEE Trans Reliability,1994,43(4) :600 - 602. 被引量:1
  • 2M O Ball, B L Golden, R V Vohra. Finding the most vital arcs in a network [J]. Operations Research Letters, 1989,8:73 - 76. 被引量:1
  • 3L B Page, J E Perry. Reliability polynomials and link importance in networks[J]. IEEE Trans. Reliability, 1994,43( 1 ):51 - 58. 被引量:1
  • 4E Nardelli, G Proietti, P Widmayer. Finding the detour-critical edge of a shortest path between two nodes [ J ]. Information Processing Letters,1998,67(1):51 -54. 被引量:1
  • 5E Nardelli, G Proietti, P Widmayer. A faster computation of the most vital edge of a shortest path [J]. Information Processing Letters,2001,79(2) :81 - 85. 被引量:1
  • 6L Traldi. Commentary on: Reliability polynomials and link importance in Networks [J]. IEEE Tmns Reliability,2000,49(3) :322. 被引量:1
  • 7L H Hsu,R H Jan,Y C Lee,et al. Finding the most vital edge with respect to minimum spanning tree in weighted graphs [J]. Information Processing Letters, 1991,39:277 - 281. 被引量:1
  • 8V V B Rao. Most-vital edge of a graph with respect to spanning trees[ J ]. IEEE Trans. Reliability, 1998,47 ( 1 ) :6 - 7. 被引量:1
  • 9M N S Swamy, K Thulasiraman. Graphs, Networks, and Algorithms[ M ]. New York : John Wiley & Sons Inc, 1981. 被引量:1

共引文献25

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部