An 0(| E |) Hypercube Recognition Algorithm

スポンサーリンク

概要

• 論文の詳細を見る

• The n-dimensional hypercube is a highly concurrent loosely coupled multiprocessor based on the binary n-cube topology. This paper is concerned with the following basic graph-theoretic question: given a graph G = (V, E), is it an exact n-cube? We propose an 0(| E |) hypercube recognition algorithm using some new topological properties of the hypercube graph.

• 社団法人電子情報通信学会の論文
• 1996-07-25

著者

• Lee Cheol-hoon

  Department Of Computer Engineering Choongnam University

• Chung Won-ho

  Department Of Computer Science At Duksung Women's University

• EUM Doohun

  Department of Computer Science at Duksung Women's University

• Eum Doohun

  Department Of Computer Science At Duksung Women's University

関連論文

• Energy-Aware Real-Time Task Scheduling Exploiting Temporal Locality
• BitNBD:BitTorrent-Based Network Block Device for Provisioning Virtual Machines in IaaS Clouds
• Deterministic Task Scheduling for Embedded Real-Time Operating Systems(Software Systems)
• An 0(| E |) Hypercube Recognition Algorithm
• WebSiteGen : Web-Based Database Application Generator
• Structural Active Object Systems for Mixed-Mode Simulation

スポンサーリンク