[图书][B] Scalable collective message-passing algorithms
PD Sack - 2011 - search.proquest.com
Governments, universities, and companies expend vast resources building the top
supercomputers. The processors and interconnect networks become faster, while the …
supercomputers. The processors and interconnect networks become faster, while the …
Scheduling light-trails on WDM rings
S Pal, A Ranade - Journal of Parallel and Distributed Computing, 2012 - Elsevier
We consider the problem of scheduling communication on optical WDM (wavelength
division multiplexing) networks using the light-trails technology. We seek to design …
division multiplexing) networks using the light-trails technology. We seek to design …
A constant time parallel algorithm for finding a vertex sequence of the directed cycle graph from the individual neighborhood information
SH Kim, J Choi - Proceedings of the Korean Institute of Information …, 2013 - koreascience.kr
In this paper, we consider the problem for finding a vertex sequence of the directed cycle
graph from the individual neighborhood information on a reconfigurable mesh (in short …
graph from the individual neighborhood information on a reconfigurable mesh (in short …
Analytic criterion and algorithm for the lowest common ancestor of two neighboring nodes in a complete binary tree
X Wang, J Zhou - … on Graphic and Image Processing (ICGIP …, 2013 - spiedigitallibrary.org
Finding the lowest common ancestor (LCA) of two nodes in a binary tree has been focused
both in graph theory and computer science. The paper puts forward and proves an analytic …
both in graph theory and computer science. The paper puts forward and proves an analytic …
Component Coloring of Proper Interval Graphs and Split Graphs
We introduce a generalization of the well known graph (vertex) coloring problem, which we
call the problem of\emph {component coloring of graphs}. Given a graph, the problem is to …
call the problem of\emph {component coloring of graphs}. Given a graph, the problem is to …
Efficient RMESH Algorithms for Computing the Intersection and the Union of Two Visibility Polygons
SH Kim - Journal of the Korea Institute of Information and …, 2016 - koreascience.kr
We can consider the following problems for two given points p and q in a simple polygon
P.(1) Compute the set of points of P which are visible from both p and q.(2) Compute the set …
P.(1) Compute the set of points of P which are visible from both p and q.(2) Compute the set …
두가시성다각형의교집합과합집합을구하는효율적인RMESH 알고리즘.
김수환 - Journal of the Korea Institute of Information & …, 2016 - search.ebscohost.com
요 약단순 다각형 내부의 두 점 와 가 주어질 때 다음의 문제를 고려할 수 있다.(1)
다각형에서 와 둘 다로부터 가시적인 점들의 집합을 구하라.(2) 와 둘 중의 적어도 …
다각형에서 와 둘 다로부터 가시적인 점들의 집합을 구하라.(2) 와 둘 중의 적어도 …
유향사이클그래프의에지집합으로부터사이클정점순서를찾는효율적인RMESH 알고리즘
김수환 - 정보과학회논문지: 시스템및이론, 2014 - dbpia.co.kr
본 논문에서는 유향 사이클 그래프의 에지 집합으로부터 사이클을 구성하는 정점들의 순서를
재구성가능한 메쉬 (RMESH) 에서 찾는 문제를 고려한다. 이 문제는 순차 알고리즘으로 선형 …
재구성가능한 메쉬 (RMESH) 에서 찾는 문제를 고려한다. 이 문제는 순차 알고리즘으로 선형 …