Finding good approximate vertex and edge partitions is NP-hard 论文

1992Information Processing Letters引用 343

VLSI and FPGA Design TechniquesComplexity and Algorithms in GraphsInterconnection Networks and Systems

VLSI and FPGA Design Techniques Complexity and Algorithms in Graphs Interconnection Networks and Systems

相关技术:Interconnection Networks and Systems Complexity and Algorithms in Graphs

Finding good approximate vertex and edge partitions is NP-hard · 相关事件

暂无数据