共查询到20条相似文献,搜索用时 15 毫秒
1.
We present a parallel algorithm for solving the minimum weighted completion time scheduling problem for transitive series parallel graphs. The algorithm takesO(log2
n) time withO(n
3) processors on a CREW PRAM, wheren is the number of vertices of the input graph. This is the first NC algorithm for solving the problem.Research supported in part by NSF Grants CCR-9011214 and CCR-9205982. 相似文献
2.
《国际计算机数学杂志》2012,89(3-4):205-226
Ghosh and Bhattacharjee propose [2] (Intern. J. Computer Math., 1984, Vol. 15, pp. 255-268) an algorithm of determining breadth first spanning trees for graphs, which requires that the input graphs contain some vertices, from which every other vertex in the input graph can be reached. These vertices are called starting vertices. The complexity of the GB algorithm is O(log2 n) using O{n 3) processors. In this paper an algorithm, named BREADTH, also computing breadth first spanning trees, is proposed. The complexity is O(log2 n) using O{n 3/logn) processors. Then an efficient parallel algorithm, named- BREADTHFOREST, is proposed, which generalizes algorithm BREADTH. The output of applying BREADTHFOREST to a general graph, which may not contain any starting vertices, is a breadth first spanning forest of the input graph. The complexity of BREADTHFOREST is the same as BREADTH. 相似文献
3.
RNA二级结构预测中动态规划的优化和有效并行 总被引:6,自引:0,他引:6
基于最小自由能模型的方法是计算生物学中RNA二级结构预测的主要方法,而计算最小自由能的动态规划算法需要O(n4)的时间,其中n是RNA序列的长度.目前有两种降低时间复杂度的策略:限制二级结构中内部环的大小不超过k,得到O(n2×k2)算法;Lyngso方法根据环的能量规则,不限制环的大小,在O(n3)的时间内获得近似最优解.通过使用额外的O(n)的空间,计算内部环中的冗余计算大为减少,从而在同样不限制环大小的情况下,在O(n3)的时间内能够获得最优解.然而,优化后的算法仍然非常耗时,通过有效的负载平衡方法,在机群系统上实现并行程序.实验结果表明,并行程序获得了很好的加速比. 相似文献
4.
Xin He 《Algorithmica》1990,5(1):545-559
We present an efficient algorithm for 4-coloring perfect planar graphs. The best previously known algorithm for this problem takesO(n
3/2) sequential time, orO(log4
n) parallel time withO(n3) processors. The sequential implementation of our algorithm takesO(n logn) time. The parallel implementation of our algorithm takesO(log3
n) time withO(n) processors on a PRAM. 相似文献
5.
We present an efficient algorithm for 4-coloring perfect planar graphs. The best previously known algorithm for this problem takesO(n 3/2) sequential time, orO(log4 n) parallel time withO(n3) processors. The sequential implementation of our algorithm takesO(n logn) time. The parallel implementation of our algorithm takesO(log3 n) time withO(n) processors on a PRAM.
相似文献6.
Lukasz Kowalik 《Algorithmica》2010,58(3):770-789
Although deciding whether the vertices of a planar graph can be colored with three colors is NP-hard, the widely known Grötzsch’s theorem states that every triangle-free planar graph is 3-colorable. We show the first o(n 2) algorithm for 3-coloring vertices of triangle-free planar graphs. The time complexity of the algorithm is $\mathcal{O}(n\log n)Although deciding whether the vertices of a planar graph can be colored with three colors is NP-hard, the widely known Gr?tzsch’s
theorem states that every triangle-free planar graph is 3-colorable. We show the first o(n
2) algorithm for 3-coloring vertices of triangle-free planar graphs. The time complexity of the algorithm is
O(nlogn)\mathcal{O}(n\log n)
. 相似文献
7.
AnO(¦E¦log2
n) algorithm is presented to construct the visibility graph for a collection ofn nonintersecting line segments, where ¦E¦ is the number of edges in the visibility graph. This algorithm is much faster than theO(n
2)-time andO(n
2)-space algorithms by Asanoet al., and by Welzl, on sparse visibility graphs. Thus we partially resolve an open problem raised by Welzl. Further, our algorithm uses onlyO(n) working storage. 相似文献
8.
We present a randomized algorithm for finding maximum matchings in planar graphs in timeO(n
ω/2), whereω is the exponent of the best known matrix multiplication algorithm. Sinceω<2.38, this algorithm breaks through theO(n
1.5) barrier for the matching problem. This is the first result of this kind for general planar graphs. We also present an algorithm
for generating perfect matchings in planar graphs uniformly at random usingO(n
ω/2) arithmetic operations. Our algorithms are based on the Gaussian elimination approach to maximum matchings introduced in
[16].
This research was supported by KBN Grant 4T11C04425. 相似文献
9.
We present an algorithm that finds out-trees and out-branchings with at least k leaves in directed graphs. These problems are known as Directed Maximum Leaf Out-Tree and Directed Maximum Leaf Out-Branching, respectively, and—in the case of undirected graphs—as Maximum Leaf Spanning Tree. The run time of our algorithm is O(4
k
nm) on directed graphs and O(poly(n)+4
k
k
2) on undirected graphs. This improves over the previously fastest algorithms for these problems with run times of 2
O(klog k)
poly(n) and O(poly(n)+6.75
k
poly(k)) respectively. 相似文献
10.
Shelby Funk 《Real-Time Systems》2010,46(3):332-359
This article presents a detailed discussion of LRE-TL (Local Remaining Execution-TL-plane), an algorithm that schedules hard real-time periodic and sporadic task sets with unconstrained
deadlines on identical multiprocessors. The algorithm builds upon important concepts such as the TL-plane construct used in
the development of the LLREF algorithm (Largest Local Remaining Execution First). This article identifies the fundamental TL-plane scheduling principles
used in the construction of LLREF . These simple principles are examined, identifying methods of simplifying the algorithm and allowing it to handle a more
general task model. For example, we identify the principle that total local utilization can never increase within any TL-plane
as long as a minimal number of tasks are executing. This observation leads to a straightforward approach for scheduling task
arrivals within a TL-plane. In this manner LRE-TL can schedule sporadic tasks and tasks with unconstrained deadlines. Like LLREF, the LRE-TL scheduling algorithm is optimal for task sets with implicit deadlines. In addition, LRE-TL can schedule task sets with unconstrained deadlines provided they satisfy the density test for multiprocessor systems. While
LLREF has a O(n
2) runtime per TL-plane, LRE-TL’s runtime is O(nlog n) per TL-plane. 相似文献
11.
L. Chen 《Algorithmica》1997,17(3):266-280
Based on Tucker's work, we present an accurate proof of the characterization of proper circular arc graphs and obtain the
first efficient parallel algorithm which not only recognizes proper circular arc graphs but also constructs proper circular
arc representations. The algorithm runs inO(log2
n) time withO(n
3) processors on a Common CRCW PRAM. The sequential algorithm can be implemented to run inO(n
2) time and is optimal if the input graph is given as an adjacency matrix, so to speak.
Portions of this paper appear in preliminary form in theProceedings of the 1989Workshop on Algorithms and Data Structures [2], and theProceedings of the 1994International Symposium on Algorithms and Computation [5]. 相似文献
12.
We present a distributed algorithm for maximum cardinality matching in general graphs. On a general graph withn vertices, our algorithm requiresO(n
5/2) messages in the worst case. On trees, our algorithm computes a maximum matching usingO(n) messages after the election of a leader.Work on this paper has been supported by the Office of Naval Research under Contract N00014-85-K-0570. 相似文献
13.
The minimum k-terminal cut problem is of considerable theoretical interest and arises in several
applied areas such as parallel and distributed computing, VLSI circuit design, and networking. In this paper
we present two new approximation and exact algorithms for this problem on an n-vertex undirected weighted
planar graph G. For the case when the k terminals are covered by the boundaries of m > 1 faces of G, we
give a min{O(n
2 log n logm), O(m
2
n
1.5 log2
n + k
n)} time algorithm with a (2–2/k)-approximation ratio
(clearly, m \le k). For the case when all k terminals are covered by the boundary of one face of G, we give an
O(n
k3 + (n log n)k
2) time exact algorithm, or a linear time exact algorithm if k = 3, for computing an optimal
k-terminal cut. Our algorithms are based on interesting observations and improve the previous algorithms when
they are applied to planar graphs. To our best knowledge, no previous approximation algorithms specifically
for solving the k-terminal cut problem on planar graphs were known before. The (2–2/k)-approximation
algorithm of Dahlhaus et al. (for general graphs) takes O(k
n
2 log n) time when applied to planar graphs. Our
approximation algorithm for planar graphs runs faster than that of Dahlhaus et al. by at least an O(k/logm)
factor (m \le k). 相似文献
14.
A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The certificate is an evidence that can be used to authenticate the correctness of the answer. A Hamiltonian cycle in a graph is a simple cycle in which each vertex of the graph appears exactly once. The Hamiltonian cycle problem is to determine whether or not a graph contains a Hamiltonian cycle. The best result for the Hamiltonian cycle problem on circular-arc graphs is an O(n2logn)-time algorithm, where n is the number of vertices of the input graph. In fact, the O(n2logn)-time algorithm can be modified as a certifying algorithm although it was published before the term certifying algorithms appeared in the literature. However, whether there exists an algorithm whose time complexity is better than O(n2logn) for solving the Hamiltonian cycle problem on circular-arc graphs has been opened for two decades. In this paper, we present an O(Δn)-time certifying algorithm to solve this problem, where Δ represents the maximum degree of the input graph. The certificates provided by our algorithm can be authenticated in O(n) time. 相似文献
15.
16.
《国际计算机数学杂志》2012,89(2):297-317
Two algorithms for shortest path problems are presented. One is to find the all-pairs shortest paths (APSP) that runs in O(n 2logn + nm) time for n-vertex m-edge directed graphs consisting of strongly connected components with O(logn) edges among them. The other is to find the single-source shortest paths (SSSP) that runs in O(n) time for graphs reducible to the trivial graph by some simple transformations. These algorithms are optimally fast for some special classes of graphs in the sense that the former achieves O(n 2) which is a lower bound of the time necessary to find APSP, and that the latter achieves O(n) which is a lower bound of the time necessary to find SSSP. The latter can be used to find APSP, also achieving the running time O(n 2). 相似文献
17.
In some hard real-time systems, relative timing constraints may be imposed on task executions, in addition to the release time and deadline constraints. Relative timing constraints such as separation or relative deadline constraints may be given between start or finish times of tasks (Gerber et al., 1995; Han and Lin, 1989; Han et al., 1992; Han and Lin, 1992; Han et al., 1996).One approach in real-time scheduling is to find a total order on a set of N tasks in a scheduling window, and cyclically use this order at run time to execute tasks. However, in the presence of relative timing constraints, if the task execution times are nondeterministic with defined lower and upper bounds, it is not always possible to statically assign task start times at pre-runtime for a given task ordering (Gerber et al., 1995).We develop a technique called dynamic cyclic dispatching as an extension of a parametric dispatching mechanism in (Gerber et al., 1995). An ordered set of N tasks is assumed to be given in a scheduling window and this schedule(ordering) is cyclically repeated at runtime in consecutive scheduling windows. Relative timing constraints between tasks may be defined across scheduling window boundaries as well as within one scheduling window. A task set is defined to be dispatchable if there exists any way in which the tasks can be dispatched with all their timing constraints satisfied. An off-line algorithm is presented to check the dispatchability of a task set and to obtain parametric lower and upper bound functions for task start times if the task set is dispatchable. These parametric bound functions are evaluated at runtime to obtain a valid time interval during which a task can be started. The complexity of this off-line component is shown to be O(n
2
N
3) where n is the number of tasks in a scheduling window that have relative timing constraints with tasks in the next scheduling window. An online algorithm can evaluate these bounds in O(N) time.Unlike static approaches which assign fixed start times to tasks in the scheduling window, our approach allows us to flexibly manage the slack times at runtime without sacrificing the dispatchability of tasks. Also, a wider class of relative timing constraints can be imposed to the task set compared to the traditional approaches. 相似文献
18.
Deterministic collect algorithms are presented that are adaptive to total contention and are efficient with respect to both
the number of registers used and the step complexity. One of them has optimal O(k) step and O(n) space complexities, but assumes that processes’ identifiers are in O(n), where n is the total number of processes in the system and k is the total contention. The step complexity of an unrestricted name space variant of this algorithm remains O(k), but its space complexity increases to O(n
2). 相似文献
19.
《国际计算机数学杂志》2012,89(12):1477-1487
Based on a Directed Acyclic Graph approach, an O(kn 2) time sequential algorithm is presented to solve the maximum weight k-independent set problem on weighted-permutation graphs. The weights considered here are all non-negative and associated with each of the n vertices of the graph. This problem has many applications in practical problems like k-machines job scheduling problem, k-colourable subgraph problem, VLSI design and routing problem. 相似文献
20.
Brigitte Jaumard Paola Marchioro Aurora Morgana Rossella Petreschi Bruno Simeone 《Annals of Mathematics and Artificial Intelligence》1990,1(1-4):155-165
We deal with the followingon-line 2-satisfiability problemP(m, n): starting fromC(0)=true, consider a sequence ofm Boolean formulasC(k) (inn variables and in conjunctive normal form), each of them being the intersection of the previous one with a single clause which is the union of two literals. Solve the sequence of 2-satisfiability problemsC(k)=true,k=1,...,m. It is well known that a 2-satisfiability problem involvingm clauses can be solved inO(m) time. Thus, by a naive approach one can solveP(m, n) in overallO(m
2) time. We present an algorithm with overallO(nm) time complexity, which for every formula not only checks its satisfiability, but also actually computes a solution (if any), and moreover, detects all forced and all identical variables. Our algorithm makes use of an efficient on-line transitive closure procedure by Italiano. We discuss two applications to the design of integrated electronic circuits and to edge classification in automated perception.To the memory of Bob Jeroslow 相似文献