A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs

Suppose that T is a spanning tree of a graph G. T is called a locally connected spanning tree of G if for every vertex of T, the set of all its neighbors in T induces a connected subgraph of G. In this paper, given an intersection model of a circular-arc graph, an O(n)-time algorithm is proposed that can determine whether the circular-arc graph contains a locally connected spanning tree or not, and produce one if it exists.     

一个新的二叉树的轮廓线索树构造算法

本文给出了二叉树的轮廓线索树的一个新的构造算法 .与 Reingdd的算法相比 ,该算法简单、高效、便于分析 ,易于推广到 m-叉树的轮廓线索树的构造算法上     

一种求关键路径的新算法

文章提出了一种求关键路径的新算法,该算法数据结构形式简单,求解方便且易于实现,并且算法能求出所有关键路径。用C语言设计了相应的程序验证了此算法。     

一种新的Kth最短路径搜索算法

借助于“背离”路径的概念,论文在2nd最短路径搜索算法的基础上提出了一种新的Kth最短路径搜索算法,并将其应用至实际环境中。通过K-1次2nd最短路径搜索算法的迭代,该算法可以求出网络中任意两个给定节点之间的Kth最短路径,2nd最短路径搜索算法在计算上具有简单性,因而也同样具有简洁、快速的特点。     

A New Approximation Algorithm for Finding Heavy Planar Subgraphs

Abstract. We provide the first nontrivial approximation algorithm for MAXIMUM WEIGHT PLANAR SUBGRAPH, the NP-hard problem of finding a heaviest planar subgraph in an edge-weighted graph G . This problem has applications in circuit layout, facility layout, and graph drawing. No previous algorithm for MAXIMUM WEIGHT PLANAR SUBGRAPH had a performance ratio exceeding 1/3 , which is obtained by any algorithm that produces a maximum weight spanning tree in G . Based on the Berman—Ramaiyer Steiner tree algorithm, the new algorithm has performance ratio at least 1/3+1/72 and at most 5/12 . We also show that if G is complete and its edge weights satisfy the triangle inequality, then the performance ratio is at least 3/8 . Furthermore, we derive the first nontrivial performance ratio (7/12 instead of 1/2 ) for the NP-hard SC MAXIMUM WEIGHT OUTERPLANAR SUBGRAPH problem.     

A New Approximation Algorithm for Finding Heavy Planar Subgraphs

We provide the first nontrivial approximation algorithm for MAXIMUM WEIGHT PLANAR SUBGRAPH, the NP-hard problem of finding a heaviest planar subgraph in an edge-weighted graph G . This problem has applications in circuit layout, facility layout, and graph drawing. No previous algorithm for MAXIMUM WEIGHT PLANAR SUBGRAPH had a performance ratio exceeding 1/3 , which is obtained by any algorithm that produces a maximum weight spanning tree in G . Based on the Berman—Ramaiyer Steiner tree algorithm, the new algorithm has performance ratio at least 1/3+1/72 and at most 5/12 . We also show that if G is complete and its edge weights satisfy the triangle inequality, then the performance ratio is at least 3/8 . Furthermore, we derive the first nontrivial performance ratio (7/12 instead of 1/2 ) for the NP-hard SC MAXIMUM WEIGHT OUTERPLANAR SUBGRAPH problem.     

求大素数的一个新算法

讨论了一些关于素数最重要的结果及其性质,同时给出一个新算法,它能快速产生大素数。     

求列表极小值的量子算法

求列表极小值的算法具有广泛的应用。如果能够找到有效的求列表极小值的量子算法,那就可以找到求列表极大值的量子算法,从而与Grover量子搜索算法、求中值量子算法一起构成一套有效的量子算法体系。这些算法将构成用量子计算求解实际应用问题的核心和基础,并为量子算法的进一步研究提供坚实的基础。该文给出了一个时间复杂度为O(N√)的求列表极小值的量子算法。     

查找整系数不可约多项式的新算法与实现程序

本文利用一种独特的映射方法将整系数多项式映射为计算机容易处理的真分数。运用该映射方法建立了一种新的算法，编写了FoxPro程序，找出了整系数不可约多项式，并且可以对这些不可约多项式按需要进行排序或查找。因此，为扩频通信与信道密码等寻找和利用不可约多项式提供了一种可行且实用的算法和程序。     

一种新的二水平多因素系统两两组合覆盖测试数据生成算法

作者系统地研究了使用已有方法对二水平多因素系统（以下简称SM2）生成的两两组合覆盖的测试数据,针对已有方法对该具体问题效果并不理想的情况,利用组合分析方法,给出了一种新的SM2测试数据生成算法,与几种现有的方法相比,生成的测试数据具有数量少、效率高的优点.将其应用于Linux的一些源代码测试以及软件配置测试的测试方案设计,结果表明生成的测试数据具有较高的代码覆盖率和错误检测能力.     

Finding Outbreak Trees in Networks with Limited Information

Real-time control of infectious disease outbreaks represents one of the greatest epidemiological challenges currently faced. In this paper we address the problem of identifying contagion patterns responsible for the spread of a disease in a network, which can be applied in real-time to evaluate an ongoing outbreak. We focus on the scenario where limited information, i.e. infection reports which may or may not include the actual source, is available during an ongoing outbreak and we seek the most likely infection tree that spans at least a set of known infected nodes. This problem can be represented using a maximum likelihood constrained Steiner tree model where the objective is to find a spanning tree with an assignment of integer nodes weights. We propose a novel formulation and solution method based on a two-step heuristic which (1) reduces the initial graph using a polynomial time algorithm designed to find feasible infection paths and (2) solves an exact mixed integer linear programming reformulation of the maximum likelihood model on the resulting subgraph. The proposed methodology can be applied to outbreaks which may evolve from multiple sources. Simulated contagion episodes are used to evaluate the performance of our solution method. Our results show that the approach is computationally efficient and is able to reconstruct a significant proportion of the outbreak, even in the context of low levels of information availability.     

在动态树中寻找祖先

文章提出了有线性预处理时间,在恒定的查询时间内,通过加叶和加根操作对树的祖先进行查找的一种有效算法,这种算法能在O(m+n)时间内进行m次祖先查询及n次增叶操作。     

A Quantum Algorithm for Finding the Modal Value

We present a quantum algorithm for finding the most often occurring (or modal) value of a data set. We thereby supplement other algorithms that can determine the mean value or similar quantities. Our algorithm requires the combined use of quantum counting and extended quantum search.      

A Faster Algorithm for Finding Minimum Tucker Submatrices

A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1s on each row are consecutive. Algorithmic issues of the C1P are central in computational molecular biology, in particular for physical mapping and ancestral genome reconstruction. In 1972, Tucker gave a characterization of matrices that have the C1P by a set of forbidden submatrices, and a substantial amount of research has been devoted to the problem of efficiently finding such a minimum size forbidden submatrix. This paper presents a new O(?? ³ m ²(m??+n ³)) time algorithm for this particular task for a m×n binary matrix with at most ?? 1-entries per row, thereby improving the O(?? ³ m ²(mn+n ³)) time algorithm of M.?Dom, J.?Guo and R.?Niedermeier [Approximation and fixed-parameter algorithms for consecutive ones submatrix problems, Journal of Computer and System Sciences, 76(3?C4): 204?C221, 2010]. Moreover, this approach can be used??with a much heavier machinery??to address harder problems related to Minimal Conflicting Set [G.?Blin, R.?Rizzi, and S.?Vialette. A Polynomial-Time Algorithm for Finding Minimal Conflicting Sets, Proc. 6th International Computer Science Symposium in Russia (CSR), [2011]].     

A Constant-Time Algorithm for Finding Neighbors in Quadtrees

Quadtrees and linear quadtrees are well-known hierarchical data structures to represent square images of size 2^{r} times 2^{r}. Finding the neighbors of a specific leaf node is a fundamental operation for many algorithms that manipulate quadtree data structures. In quadtrees, finding neighbors takes O(r) computational time for the worst case, where r is the resolution (or height) of a given quadtree. Schrack [1] proposed a constant-time algorithm for finding equal-sized neighbors in linear quadtrees. His algorithm calculates the location codes of equal-sized neighbors; it says nothing, however, about their existence. To ensure their existence, additional checking of the location codes is needed, which usually takes O(r) computational time. In this paper, a new algorithm to find the neighbors of a given leaf node in a quadtree is proposed which requires just O(1) (i.e., constant) computational time for the worst case. Moreover, the algorithm takes no notice of the existence or nonexistence of neighbors. Thus, no additional checking is needed. The new algorithm will greatly reduce the computational complexities of almost all algorithms based on quadtrees.     

A Distributed Algorithm for Constructing Minimal Spanning Trees

Most algorithms for constructing minimal spanning trees are sequential in operation. Distributed algorithms for constructing these trees operate both concurrently and asynchronously, and are useful in store-and-forward packet-switching computer-communication networks where there is typically no single source of control. The difficulties in designing such algorithms arise from communication and synchronization problems. This paper discusses these problems and describes the first distributed algorithm for constructing minimal spanning trees. This algorithm and the principles and techniques underlying its design will find application in large communication networks and large multiprocessor computer systems.     

A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs

Given an edge-weighted undirected graph G and two prescribed vertices u and v, a next-to-shortest (u,v)-path is a shortest (u,v)-path amongst all (u,v)-paths having length strictly greater than the length of a shortest (u,v)-path. In this paper, we deal with the problem of computing a next-to-shortest (u,v)-path. We propose an O(n²){\mathcal{O}}(n^{2}) time algorithm for solving this problem, which significantly improves the bound of a previous one in O(n³){\mathcal{O}}(n^{3}) time where n is the number of vertices in G.     

基于A*算法的全局路径搜索

解决路径搜索问题有许多算法。本文基于A*算法,选择不同的估价函数进行路径搜索,找出在不同环境下的尽可能优化的路径,确定一种合适的估价函数,解决移动机器人的避障与导航问题。通过VC 6.0程序语言进行仿真实验,验证所选择的路径。