期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Minor and Minimum Cycle Bases of a 3-connected Planar Graph 被引量:1
1
作者 Deng Ju MA Han REN 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2009年第4期649-656,共8页
In this paper, we prove that if any set of |E(G)|- |V(G)| + 1 facial cycles of a 3-connected planar graph G embedded in the plane doesn't form a minimum cycle base of G, then any minimum cycle base of G cont... In this paper, we prove that if any set of |E(G)|- |V(G)| + 1 facial cycles of a 3-connected planar graph G embedded in the plane doesn't form a minimum cycle base of G, then any minimum cycle base of G contains a separating cycle, and G has a minor isomorphic to T6, where T6 is the graph obtained from the complete graph K6 by deleting a path with four edges. 展开更多
关键词 cycle space minimum cycle base 3-connected planar graph
原文传递
Comparative Study of foF2 during Quiet Geomagnetic Activity with URSI and CCIR Predictions during the Phase Minimum of Solar Cycle 22
2
作者 Moustapha Konaté Abidina Diabaté +2 位作者 Kadidia Nonlo Drabo Emmanuel Nanéma Frédéric Ouattara 《Journal of Applied Mathematics and Physics》 2022年第12期3562-3571,共10页
This paper investigates the performance of the latest International Reference Ionosphere model to predict the critical frequency at low latitudes in the African region. The variability of the critical frequency of the... This paper investigates the performance of the latest International Reference Ionosphere model to predict the critical frequency at low latitudes in the African region. The variability of the critical frequency of the F2 layer of the ionosphere (foF2) is studied for the different seasons of the phase minimum of solar cycle 22 during quiet geomagnetic activity at the Ouagadougou station. The data used are those provided by the ionosonde and the predictions of the two subprograms: International Radio Consultative Committee (CCIR) and International Radio-Scientific Union (URSI) of the 2016 version of the International Reference Ionosphere model. This study shows that, in general, URSI and CCIR of the IRI-2016 model are able to reproduce fairly well the variability of the critical frequency of the F2 layer of the ionosphere at low latitudes during the phase minimum at the Ouagadougou station. However, the model shows an almost homogeneous overestimation of the foF2 during the four seasons studied. The good response is observed between 0700 TL and 1900 TL for the available data. The agreement between the subroutine responses and the observed results is between reasonable and poor. The best match state response is obtained in winter with the CCIR subroutine. These results show that there is a need to improve both CCIR and URSI subroutines of the IRI-2016 model in low latitudes in the African region. 展开更多
关键词 FOF2 IRI IONOSONDE Quiet Time Periods Solar cycle Phase minimum
下载PDF
Efficient Parallel Algorithms for Some Graph Theory Problems
3
作者 马军 马绍汉 《Journal of Computer Science & Technology》 SCIE EI CSCD 1993年第4期362-366,共5页
In this paper,a sequential algorithm computing the all vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is sho... In this paper,a sequential algorithm computing the all vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is shown.This method can also be used to get a parallel algorithm to compute transitive closure arrayof an undirected graph.The time complexify of the parallel algorithm is O(n^3/p).If D,P andare known,it is shown that the problems to find all connected components, to compute the diameter of an undirected graph,to determine the center of a directed graph and to search for a directed cycle with the minimum(maximum)length in a directed graph can all be solved in O(n^2/p^+ logp)time. 展开更多
关键词 Parallel graph algorithms shortest paths transitive closure connected components diameter of graph center of graph directed cycle with the minimum (maximum)length parallel random access machines (PRAMs)
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部