期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到2,472篇文章
< 1 2 … 124 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Hashgraph共识算法研究与优化 认领 引用
1
作者 王迪 曹广平 雷航 《计算机工程与设计》 北大核心 2026年第1期113-119,共7页
针对Hashgraph共识过程中事件接受延迟高、共识率低的问题,提出一种基于贪心Gossip策略的Hashgraph共识算法,使哈希图中新创建的事件尽可能多的可见和强可见祖先事件,加快轮次的提升与事件的接受。实验结果表明,该算法在相同轮次下所需... 针对Hashgraph共识过程中事件接受延迟高、共识率低的问题,提出一种基于贪心Gossip策略的Hashgraph共识算法,使哈希图中新创建的事件尽可能多的可见和强可见祖先事件,加快轮次的提升与事件的接受。实验结果表明,该算法在相同轮次下所需事件数与事件被接受所需轮次数均少于Hashgraph,共识率与吞吐量均优于Hashgraph,且共识率波动更小,同时保持了与原有算法几乎一致的安全性和计算开销。 展开更多
关键词 哈希图 共识算法 虚拟投票 强可见 有向无环图 见证者 汉明距离
暂未订购 下载PDF
基于图计算框架Spark GraphFrames的路网分区算法 认领 引用
2
作者 任刚 郜广兰 +1 位作者 刘小杰 王朝云 《河南工学院学报》 CAS 2026年第4期14-17,共4页
提出一种基于图计算框架Spark GraphFrames的路网分区算法SG-RNPA。该算法利用路网拓扑结构创建图模型,以交通流量为依据,利用标签传播算法实现交通子区识别。依托Spark GraphFrames的分布式图计算能力,SG-RNPA能够处理城市级大规模路... 提出一种基于图计算框架Spark GraphFrames的路网分区算法SG-RNPA。该算法利用路网拓扑结构创建图模型,以交通流量为依据,利用标签传播算法实现交通子区识别。依托Spark GraphFrames的分布式图计算能力,SG-RNPA能够处理城市级大规模路网数据。实验结果表明,所提算法能够有效识别交通子区,分区结果在均衡性及结构合理性方面表现良好。 展开更多
关键词 交通分区 Spark GraphFrames 图计算 标签传播算法
暂未订购 下载PDF
User-Oriented Graph Based Frequency Allocation Algorithm for Densely Deployed Femtocell Network 认领 引用 被引量：9
3
作者 栾智荣 曲桦 +1 位作者 赵季红 徐西光 《China Communications》 SCIE CSCD 2013年第12期57-65,共9页
Femtocell is a promising technology for improving indoor coverage and offloading the macrocell.Femtocells tend to be densely deployed in populated areas such as the dormitories.However,the inter-tier interference seri... Femtocell is a promising technology for improving indoor coverage and offloading the macrocell.Femtocells tend to be densely deployed in populated areas such as the dormitories.However,the inter-tier interference seriously exists in the co-channel Densely Deployed Femtocell Network(DDFN).Since the Femtocell Access Points(FAPs) are randomly deployed by their customers,the interference cannot be predicted in advance.Meanwhile,new characteristics such as the short radius of femtocell and the small number of users lead to the inefficiency of the traditional frequency reuse algorithms such as Fractional Frequency Reuse(FFR).Aiming for the downlink interference coordination in the DDFN,in this paper,we propose a User-oriented Graph based Frequency Allocation(UGFA)algorithm.Firstly,we construct the interference graph for users in the network.Secondly,we study the conventional graph based resources allocation algorithm.Then an improved two steps graph based frequency allocation mechanism is proposed.Simulation results show that UGFA has a high frequency reuse ratio mean while guarantees a better throughput. 展开更多
关键词 densely deployed femtocell net-work interference coordination frequency res-ource management graph based algorithms
暂未订购 下载PDF
Jointly-check iterative decoding algorithm for quantum sparse graph codes 认领 引用 被引量：2
4
作者 邵军虎 白宝明 +1 位作者 林伟 周林 《Chinese Physics B》 SCIE EI CAS 2010年第8期116-122,共7页
For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. ... For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement. 展开更多
关键词 quantum error correction sparse graph code iterative decoding belief-propagation algorithm
暂未订购 下载PDF
A Sharding Scheme Based on Graph Partitioning Algorithm for Public Blockchain 认领 引用 被引量：1
5
作者 Shujiang Xu Ziye Wang +4 位作者 Lianhai Wang Miodrag J.Mihaljevi′c Shuhui Zhang Wei Shao Qizheng Wang 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第6期3311-3327,共17页
Blockchain technology,with its attributes of decentralization,immutability,and traceability,has emerged as a powerful catalyst for enhancing traditional industries in terms of optimizing business processes.However,tra... Blockchain technology,with its attributes of decentralization,immutability,and traceability,has emerged as a powerful catalyst for enhancing traditional industries in terms of optimizing business processes.However,transaction performance and scalability has become the main challenges hindering the widespread adoption of blockchain.Due to its inability to meet the demands of high-frequency trading,blockchain cannot be adopted in many scenarios.To improve the transaction capacity,researchers have proposed some on-chain scaling technologies,including lightning networks,directed acyclic graph technology,state channels,and shardingmechanisms,inwhich sharding emerges as a potential scaling technology.Nevertheless,excessive cross-shard transactions and uneven shard workloads prevent the sharding mechanism from achieving the expected aim.This paper proposes a graphbased sharding scheme for public blockchain to efficiently balance the transaction distribution.Bymitigating crossshard transactions and evening-out workloads among shards,the scheme reduces transaction confirmation latency and enhances the transaction capacity of the blockchain.Therefore,the scheme can achieve a high-frequency transaction as well as a better blockchain scalability.Experiments results show that the scheme effectively reduces the cross-shard transaction ratio to a range of 35%-56%and significantly decreases the transaction confirmation latency to 6 s in a blockchain with no more than 25 shards. 展开更多
关键词 Blockchain sharding graph partitioning algorithm
暂未订购 下载PDF
An effective multi-level algorithm based on ant colony optimization for graph bipartitioning 认领 引用 被引量：3
6
作者 冷明 郁松年 +1 位作者 丁旺 郭强 《Journal of Shanghai University(English Edition)》 2008年第5期426-432,共7页
Partitioning is a fundamental problem with applications to many areas including data mining, parellel processing and Very-large-scale integration （VLSI） design. An effective multi-level algorithm for bisecting graph... Partitioning is a fundamental problem with applications to many areas including data mining, parellel processing and Very-large-scale integration （VLSI） design. An effective multi-level algorithm for bisecting graph is proposed. During its coarsening phase, an improved matching approach based on the global information of the graph core is developed with its guidance function. During the refinement phase, the vertex gain is exploited as ant＇s heuristic information and a positive feedback method based on pheromone trails is used to find the global approximate bipartitioning. It is implemented with American National Standards Institute （ANSI） C and compared to MeTiS. The experimental evaluation shows that it performs well and produces encouraging solutions on 18 different graphs benchmarks. 展开更多
关键词 rain-cut graph bipartitioning multi-level algorithm ant colony optimization （ACO）
暂未订购 下载PDF
BAR:a branch-alternation-resorting algorithm for locality exploration in graph processing 认领 引用 被引量：1
7
作者 邓军勇 WANG Junjie +2 位作者 JIANG Lin XIE Xiaoyan ZHOU Kai 《High Technology Letters》 EI CAS 2024年第1期31-42,共12页
Unstructured and irregular graph data causes strong randomness and poor locality of data accesses in graph processing.This paper optimizes the depth-branch-resorting algorithm(DBR),and proposes a branch-alternation-re... Unstructured and irregular graph data causes strong randomness and poor locality of data accesses in graph processing.This paper optimizes the depth-branch-resorting algorithm(DBR),and proposes a branch-alternation-resorting algorithm(BAR).In order to make the algorithm run in parallel and improve the efficiency of algorithm operation,the BAR algorithm is mapped onto the reconfigurable array processor(APR-16)to achieve vertex reordering,effectively improving the locality of graph data.This paper validates the BAR algorithm on the GraphBIG framework,by utilizing the reordered dataset with BAR on breadth-first search(BFS),single source shortest paht(SSSP)and betweenness centrality(BC)algorithms for traversal.The results show that compared with DBR and Corder algorithms,BAR can reduce execution time by up to 33.00%,and 51.00%seperatively.In terms of data movement,the BAR algorithm has a maximum reduction of 39.00%compared with the DBR algorithm and 29.66%compared with Corder algorithm.In terms of computational complexity,the BAR algorithm has a maximum reduction of 32.56%compared with DBR algorithm and53.05%compared with Corder algorithm. 展开更多
关键词 graph processing vertex reordering branch-alternation-resorting algorithm(BAR) reconfigurable array processor
暂未订购 下载PDF
Simulated annealing algorithm for detecting graph isomorphism 认领 引用 被引量：4
8
作者 Geng Xiutang Zhang Kai 《Journal of Systems Engineering and Electronics》 SCIE EI 2008年第5期1047-1052,共6页
Evolutionary computation techniques have mostly been used to solve various optimization problems,and it is well known that graph isomorphism problem(GIP)is a nondeterministic polynomial problem.A simulated annealing(S... Evolutionary computation techniques have mostly been used to solve various optimization problems,and it is well known that graph isomorphism problem(GIP)is a nondeterministic polynomial problem.A simulated annealing(SA)algorithm for detecting graph isomorphism is proposed,and the proposed SA algorithm is well suited to deal with random graphs with large size.To verify the validity of the proposed SA algorithm,simulations are performed on three pairs of small graphs and four pairs of large random graphs with edge densities 0.5,0.1,and 0.01,respectively.The simulation results show that the proposed SA algorithm can detect graph isomorphism with a high probability. 展开更多
关键词 graph isomorphism problem simulated annealing algorithm nondeterministic polynomial problem,local search.
暂未订购 下载PDF
Betweenness-based algorithm for a partition scale-free graph 认领 引用
9
作者 张百达 吴俊杰 +1 位作者 唐玉华 周静 《Chinese Physics B》 SCIE EI CAS CSCD 2011年第11期556-564,共9页
Many real-world networks are found to be scale-free. However, graph partition technology, as a technology capable of parallel computing, performs poorly when scale-free graphs are provided. The reason for this is that... Many real-world networks are found to be scale-free. However, graph partition technology, as a technology capable of parallel computing, performs poorly when scale-free graphs are provided. The reason for this is that traditional partitioning algorithms are designed for random networks and regular networks, rather than for scale-free networks. Multilevel graph-partitioning algorithms are currently considered to be the state of the art and are used extensively. In this paper, we analyse the reasons why traditional multilevel graph-partitioning algorithms perform poorly and present a new multilevel graph-partitioning paradigm, top down partitioning, which derives its name from the comparison with the traditional bottom-up partitioning. A new multilevel partitioning algorithm, named betweenness-based partitioning algorithm, is also presented as an implementation of top-down partitioning paradigm. An experimental evaluation of seven different real-world scale-free networks shows that the betweenness-based partitioning algorithm significantly outperforms the existing state-of-the-art approaches. 展开更多
关键词 graph partitioning betweenness-based partitioning algorithm scale free network
暂未订购 下载PDF
The Refinement Algorithm Consideration in Text Clustering Scheme Based on Multilevel Graph 认领 引用
10
作者 CHENJian-bin DONGXiang-jun SONGHan-tao 《Wuhan University Journal of Natural Sciences》 EI CAS 2004年第5期671-675,共5页
To construct a high efficient text clustering algorithm the multilevel graph model and the refinement algorithm used in the uncoarsening phase is discussed. The model is applied to text clustering. The performance of ... To construct a high efficient text clustering algorithm the multilevel graph model and the refinement algorithm used in the uncoarsening phase is discussed. The model is applied to text clustering. The performance of clustering algorithm has to be improved with the refinement algorithm application. The experiment result demonstrated that the multilevel graph text clustering algorithm is available. Key words text clustering - multilevel coarsen graph model - refinement algorithm - high-dimensional clustering CLC number TP301 Foundation item: Supported by the National Natural Science Foundation of China (60173051)Biography: CHEN Jian-bin(1970-), male, Associate professor, Ph. D., research direction: data mining. 展开更多
关键词 text clustering multilevel coarsen graph model refinement algorithm high-dimensional clustering
暂未订购 下载PDF
A Graph Drawing Algorithm for Visualizing Multivariate Categorical Data 认领 引用
11
作者 HUANG Jingwei HUANG Jie 《Wuhan University Journal of Natural Sciences》 CAS 2007年第2期239-242,共4页
In this paper, a new approach for visualizing multivariate categorical data is presented. The approach uses a graph to represent multivariate categorical data and draws the graph in such a way that we can identify pat... In this paper, a new approach for visualizing multivariate categorical data is presented. The approach uses a graph to represent multivariate categorical data and draws the graph in such a way that we can identify patterns, trends and relationship within the data. A mathematical model for the graph layout problem is deduced and a spectral graph drawing algorithm for visualizing multivariate categorical data is proposed. The experiments show that the drawings by the algorithm well capture the structures of multivariate categorical data and the computing speed is fast. 展开更多
关键词 multivariate categorical data graph graph drawing algorithms
暂未订购 下载PDF
基于GraphSAGE算法的电力物联设备故障预测 认领 引用 被引量：1
12
作者 李世豪 曾锃 +3 位作者 缪巍巍 夏元轶 刘鹏飞 赵海涛 《计算机技术与发展》 2025年第5期145-151,共7页
电力系统的安全稳定运行是保障国家能源安全和经济发展的关键,而这在很大程度上依赖于对电力物联设备故障的准确预测。当前,随着电力物联网技术的发展,大量的数据被采集,但这些数据的潜在价值尚未得到充分挖掘,这在一定程度上限制了故... 电力系统的安全稳定运行是保障国家能源安全和经济发展的关键,而这在很大程度上依赖于对电力物联设备故障的准确预测。当前,随着电力物联网技术的发展,大量的数据被采集,但这些数据的潜在价值尚未得到充分挖掘,这在一定程度上限制了故障预测的准确性,影响了电力系统的可靠运行。针对这一问题,该文提出了一种创新的基于GraphSAGE(Graph Sample and Aggregate)算法的电力物联设备故障预测。该方法通过PowerGraph数据集,将电力物联设备故障场景细分为四类,利用GraphSAGE模型的特性,深入学习和分析节点特征与边特征,从而实现对物联设备故障的有效预测。实验结果表明,该方法准确率达到97.5%,相较于其它传统方法,准确率提高了0.39%~6.21%,同时GraphSAGE模型实现了快速训练。该方法为电力物联设备安全稳定运行提供重要决策支持,能够对动态和相互联系的复杂系统进行更精细的分析,并增强电力系统运营部门对潜在干扰的预见和应对能力。 展开更多
关键词 电力系统 电力物联网 GraphSAGE算法 电力物联设备故障 有效预测
暂未订购 下载PDF
Task Graph Reduction Algorithm for Hardware/Software Partitioning 认领 引用 被引量：2
13
作者 LI Hui LIU Wenjui +2 位作者 WU Jigang JIANG Guiyuan HAN Honglei 《Wuhan University Journal of Natural Sciences》 CAS 2012年第2期126-130,共5页
Hardware/software（HW/SW） partitioning is one of the key processes in an embedded system.It is used to determine which system components are assigned to hardware and which are processed by software.In contrast with p... Hardware/software（HW/SW） partitioning is one of the key processes in an embedded system.It is used to determine which system components are assigned to hardware and which are processed by software.In contrast with previous research that focuses on developing efficient heuristic,we focus on the pre-process of the task graph before the HW/SW partitioning in this paper,that is,enumerating all the sub-graphs that meet the requirements.Experimental results showed that the original graph can be reduced to 67% in the worst-case scenario and 58% in the best-case scenario.In conclusion,the reduced task graph saved hardware area while improving partitioning speed and accuracy. 展开更多
关键词 HW/SW partitioning task graph algorithm embedded system
暂未订购 下载PDF
A Linear-Time Algorithm for 2-Step Domination in Block Graphs 认领 引用
14
作者 Yancai ZHAO Lianying MIAO Zuhua LIAO 《Journal of Mathematical Research with Applications》 CSCD 2015年第3期285-290,共6页
The 2-step domination problem is to find a minimum vertex set D of a graph such that every vertex of the graph is either in D or at distance two from some vertex of D. In the present paper, by using a labeling method,... The 2-step domination problem is to find a minimum vertex set D of a graph such that every vertex of the graph is either in D or at distance two from some vertex of D. In the present paper, by using a labeling method, we provide an O（m） time algorithm to solve the 2-step domination problem on block graphs, a superclass of trees. 展开更多
关键词 2-step domination block graph algorithm labeling method
暂未订购 下载PDF
Totally Coded Method for Signal Flow Graph Algorithm 认领 引用 被引量：4
15
作者 徐静波 周美华 《Journal of Donghua University(English Edition)》 EI CAS 2002年第2期63-68,共6页
After a code-table has been established by means of node association information from signal flow graph, the totally coded method (TCM) is applied merely in the domain of code operation beyond any figure-earching algo... After a code-table has been established by means of node association information from signal flow graph, the totally coded method (TCM) is applied merely in the domain of code operation beyond any figure-earching algorithm. The code-series (CS) have the holo-information nature, so that both the content and the sign of each gain-term can be determined via the coded method. The principle of this method is simple and it is suited for computer programming. The capability of the computer-aided analysis for switched current network (SIN) can be enhanced. 展开更多
关键词 Signal flow graph, algorithm, coded method, SIN.
暂未订购 下载PDF
Blockchain Based Consensus Algorithm and Trustworthy Evaluation of Authenticated Subgraph Queries 认领 引用
16
作者 G.Sharmila M.K.Kavitha Devi 《Computer Systems Science & Engineering》 SCIE EI 2023年第5期1743-1758,共16页
Over the past era,subgraph mining from a large collection of graph database is a crucial problem.In addition,scalability is another big problem due to insufficient storage.There are several security challenges associa... Over the past era,subgraph mining from a large collection of graph database is a crucial problem.In addition,scalability is another big problem due to insufficient storage.There are several security challenges associated with subgraph mining in today’s on-demand system.To address this downside,our proposed work introduces a Blockchain-based Consensus algorithm for Authenticated query search in the Large-Scale Dynamic Graphs(BCCA-LSDG).The two-fold process is handled in the proposed BCCA-LSDG:graph indexing and authenticated query search(query processing).A blockchain-based reputation system is meant to maintain the trust blockchain and cloud server of the proposed architecture.To resolve the issues and provide safe big data transmission,the proposed technique also combines blockchain with a consensus algorithm architecture.Security of the big data is ensured by dividing the BC network into distinct networks,each with a restricted number of allowed entities,data kept in the cloud gate server,and data analysis in the blockchain.The consensus algorithm is crucial for maintaining the speed,performance and security of the blockchain.Then Dual Similarity based MapReduce helps in mapping and reducing the relevant subgraphs with the use of optimal feature sets.Finally,the graph index refinement process is undertaken to improve the query results.Concerning query error,fuzzy logic is used to refine the index of the graph dynamically.The proposed technique outperforms advanced methodologies in both blockchain and non-blockchain systems,and the combination of blockchain and subgraph provides a secure communication platform,according to the findings. 展开更多
关键词 Big data blockchain consensus algorithm trust management graph index
暂未订购 下载PDF
Modelling of a WDM Network Using Graph Theory and Dijkstra Algorithm for Traffic Redirection 认领 引用
17
作者 Eric Michel Deussom Djomadji Ebude Carine Awasume Eloundou Boris Donald 《Journal of Computer and Communications》 2024年第7期78-93,共16页
Optical transport networks are now the basic infrastructure of modern communications systems, including the SDH and WDM backbone network of local network operators, in the case of Cameroon. Given the colossal investme... Optical transport networks are now the basic infrastructure of modern communications systems, including the SDH and WDM backbone network of local network operators, in the case of Cameroon. Given the colossal investments required to deploy these networks, particularly related to the cost of equipment (optical fibers, transponders and multiplexers), the optimization of bandwidth and dynamic allocation of resources is essential to control operating costs and ensure continuity of service. Automatic switching technology for optical networks brings intelligence to the control plane to fully facilitate bandwidth utilization, traffic redirection, and automatic configuration of end-to-end services. This paper considers a local network operator’s WDM network without the implementation of the automatic switching technology, develops a network modeling software platform called Graphic Networks and using graph theory integrates a particularity of the automatic switching technology, which is the automatic rerouting of traffic in case of incident in the network. The incidents considered here are those links or route failures and node failures. 展开更多
关键词 Graph Theory Backbone Network WDM Djikstra Algorithm
暂未订购 下载PDF
Optimal parallel algorithm for shortest-paths problem on interval graphs 认领 引用
18
作者 MISHRAP.K. 《Journal of Zhejiang University Science》 2004年第9期1135-1143,共9页
This paper presents an efficient parallel algorithm for the shortest-path problem in interval graph for computing shortest-paths in a weighted interval graph that runs in O(n) time with n intervals in a graph. A linea... This paper presents an efficient parallel algorithm for the shortest-path problem in interval graph for computing shortest-paths in a weighted interval graph that runs in O(n) time with n intervals in a graph. A linear processor CRCW algorithm for determining the shortest-paths in an interval graphs is given. 展开更多
关键词 Parallel algorithms Shortest-paths problem Interval graphs
暂未订购 下载PDF
A Novel Symbolic Algorithm for Maximum Weighted Matching in Bipartite Graphs 认领 引用 被引量：1
19
作者 Tianlong Gu Liang Chang Zhoubo Xu 《International Journal of Communications, Network and System Sciences》 2011年第2期111-121,共11页
The maximum weighted matching problem in bipartite graphs is one of the classic combinatorial optimization problems, and arises in many different applications. Ordered binary decision diagram (OBDD) or algebraic decis... The maximum weighted matching problem in bipartite graphs is one of the classic combinatorial optimization problems, and arises in many different applications. Ordered binary decision diagram (OBDD) or algebraic decision diagram (ADD) or variants thereof provides canonical forms to represent and manipulate Boolean functions and pseudo-Boolean functions efficiently. ADD and OBDD-based symbolic algorithms give improved results for large-scale combinatorial optimization problems by searching nodes and edges implicitly. We present novel symbolic ADD formulation and algorithm for maximum weighted matching in bipartite graphs. The symbolic algorithm implements the Hungarian algorithm in the context of ADD and OBDD formulation and manipulations. It begins by setting feasible labelings of nodes and then iterates through a sequence of phases. Each phase is divided into two stages. The first stage is building equality bipartite graphs, and the second one is finding maximum cardinality matching in equality bipartite graph. The second stage iterates through the following steps: greedily searching initial matching, building layered network, backward traversing node-disjoint augmenting paths, updating cardinality matching and building residual network. The symbolic algorithm does not require explicit enumeration of the nodes and edges, and therefore can handle many complex executions in each step. Simulation experiments indicate that symbolic algorithm is competitive with traditional algorithms. 展开更多
关键词 Bipartite Graphs Weighted Matching Symbolic Algorithm Algebraic Decision Diagram (ADD) Ordered Binary Decision Diagram (OBDD)
暂未订购 下载PDF
Algorithm for Visualization of Zero Divisor Graphs of the Ring ℤn Using MAPLE Coding 认领 引用
20
作者 Nasir Ali 《Open Journal of Discrete Mathematics》 2024年第1期1-8,共8页
This research investigates the comparative efficacy of generating zero divisor graphs (ZDGs) of the ring of integers ℤn modulo n using MAPLE algorithm. Zero divisor graphs, pivotal in the study of ring theory, depict ... This research investigates the comparative efficacy of generating zero divisor graphs (ZDGs) of the ring of integers ℤn modulo n using MAPLE algorithm. Zero divisor graphs, pivotal in the study of ring theory, depict relationships between elements of a ring that multiply to zero. The paper explores the development and implementation of algorithms in MAPLE for constructing these ZDGs. The comparative study aims to discern the strengths, limitations, and computational efficiency of different MAPLE algorithms for creating zero divisor graphs offering insights for mathematicians, researchers, and computational enthusiasts involved in ring theory and mathematical computations. 展开更多
关键词 Zero Divisor Graph Ring Theory Maple Algorithm ℤn Modulo n Graph Theory Mathematical Computing
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 124 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈