共查询到20条相似文献,搜索用时 46 毫秒
1.
一类实际网络中的最小截算法 总被引:9,自引:0,他引:9
讨论了节点和边都有容量限制的无向平面网络中的两点间的最小截问题.传统方法是把节点和边都有容量的网络中的最小截问题转化为只有边有容量的问题,但该方法用在平面网络时不能保持网络的平面性,因此网络的平面性不能得到利用.使用传统方法的计算时间为O(n2logn)(其中n为网络的节点数).给出了可以充分利用网络平面性的方法.对源和汇共面的s-t平面网络,把最小截问题转化为平面图上两点间的最短路径问题,从而可以得到O(n)时间的算法;对一般的平面网络,给出了新的将节点和边都有容量的问题转化为仅边有容量问题的方法,这种转化方法不破坏网络的平面性,从而可以利用平面网络中仅边有容量问题的计算方法,使原问题在O(nlogn)时间内获得解决. 相似文献
2.
In this paper, we put forward an anticipation mechanism for the existing Physarum-inspired shortest path finding method. The Physarum-based shortest path finding model can be implemented by an iterative algorithm and has wide applications in many fundamental network optimization problems. In this paper, we mainly focus on the Physarum-inspired shortest path tree model. Normally, we stop the program when the difference between two consecutive iterations is less than a predefined threshold. However, we do not know how to set the specific value for the threshold variable. In order to find out the optimal solution, we need to set the threshold as a very small number. This in turn will consume a lot of time. From this point of view, this algorithm lacks an efficient and reliable mechanism to judge when the optimal solution will be found. In this paper, we introduce an anticipation mechanism to address this issue. Numerical examples are used to demonstrate its reliability and efficiency. 相似文献
3.
Computing shortest paths in a directed graph has received considerable attention in the sequential RAM model of computation. However, developing a polylog-time parallel algorithm that is close to the sequential optimal in terms of the total work done remains an elusive goal. We present a first step in this direction by giving efficient parallel algorithms for shortest paths in planar layered digraphs.We show that these graphs admit special kinds of separators calledone- way separators which allow the paths in the graph to cross it only once. We use these separators to give divide- and -conquer solutions to the problem of finding the shortest paths between any two vertices. We first give a simple algorithm that works in the CREW model and computes the shortest path between any two vertices in ann-node planar layered digraph in timeO(log2
n) usingn/logn processors. We then use results of Aggarwal and Park [1] and Atallah [4] to improve the time bound toO(log2
n) in the CREW model andO(logn log logn) in the CREW model. The processor bounds still remain asn/logn for the CREW model andn/log logn for the CRCW model.Support for the first and third authors was provided in part by a National Science Foundation Presidential Young Investigator Award CCR-9047466 with matching funds from IBM, by NSF Research Grant CCR-9007851, by Army Research Office Grant DAAL03-91-G-0035, and by the Office of Naval Research and the Advanced Research Projects Agency under Contract N00014-91-J-4052, ARPA, Order 8225. Support for the second author was provided in part by NSF Research Grant CCR-9007851, by Army Research Office Grant DAAL03-91-G-0035, and by the Office of Naval Research and the Advanced Research Projects Agency under Contract N00014-91-J-4052 and ARPA Order 8225. 相似文献
4.
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. 相似文献
5.
Lokendra Singh Umrao Ravi Shankar Singh 《International Journal of Parallel, Emergent and Distributed Systems》2016,31(3):294-304
This paper presented a routing algorithm that finds n disjoint shortest paths from the source node s to target node d in the n-dimensional hypercube. Fault-tolerant routing over all shortest node-disjoint paths has been investigated to overcome the failure encountered during routing in hypercube networks. In this paper, we proposed an efficient approach to provide fault-tolerant routing which has been investigated on hypercube networks. The proposed approach is based on all shortest node-disjoint paths concept in order to find a fault-free shortest path among several paths provided. The proposed algorithm is a simple uniform distributed algorithm that can tolerate a large number of process failures, while delivering all n messages over optimal-length disjoint paths. However, no distributed algorithm uses acknowledgement messages (acks) for fault tolerance. So, for dealing the faults, acknowledgement messages (acks) are included in the proposed algorithm for routing messages over node-disjoint paths in a hypercube network. 相似文献
6.
Algorithms for a Class of Isotonic Regression Problems 总被引:4,自引:0,他引:4
The isotonic regression problem has applications in statistics, operations research, and image processing. In this paper
a general framework for the isotonic regression algorithm is proposed. Under this framework, we discuss the isotonic regression
problem in the case where the directed graph specifying the order restriction is a directed tree with n vertices. A new algorithm is presented for this case, which can be regarded as a generalization of the PAV algorithm of
Ayer et al. Using a simple tree structure such as the binomial heap, the algorithm can be implemented in O(n log n) time, improving the previously best known O(n
2
) time algorithm. We also present linear time algorithms for special cases where the directed graph is a path or a star.
Received September 2, 1997; revised January 2, 1998, and February 16, 1998. 相似文献
7.
A flip or edge-replacement is considered as a transformation by which one edge e of a geometric object is removed and an edge f (f≠e) is inserted such that the resulting object belongs to the same class as the original object. Here, we consider Hamiltonian planar paths as geometric objects. A technique is presented for transforming a given planar path into another one for a set S of n points in convex position in the plane. Under these conditions, we show that any planar path can be transformed into another planar path by at most 2n−5 flips. For the case when the points are in general position we provide experimental results regarding transformability of any planar path into another. We show that for n?8 points in general position any two paths can be transformed into each other. For n points in convex position we show that there are n2n−2 directed Hamiltonian planar paths. An algorithm is presented which uses flips of size 1 and flips of size 2 to generate all such paths with O(n) time between the generation of two successive paths. 相似文献
8.
《国际计算机数学杂志》2012,89(3-4):141-156
We address the problem of collision free navigation of a point robot among polygonal obstacles in a bounded known terrain in two dimensional space. The obstacles could be convex or concave polygons. We consider a combinatorial approach to the problem and focus on partitioning the terrain into distinct regions and encoding these regions. We then build a region-graph whose nodes represent the regions and every pair of neighbouring regions (nodes) are connected by an edge. We propose an o(n 4) preprocessing algorithm to do this. This converts the problem of navigation from a source point to a destination point into a problem of finding a path in a planar graph from one of its nodes to another in O (n 2 log n) time. The shortest path is derivable in 0(n 4) time. The extension of the algorithm for three-dimensional space is also discussed. 相似文献
9.
约束网络为计算机科学中的许多问题提供了一种有效的表示方法.一般而言,约束满足问题是NP完全的.然而,许多实际问题通常对约束的结构或形式施加了特殊的限制,从而能够高效地加以解决.迄今,为了识别易处理约束类,人们对特殊的约束或约束网络方面进行了许多研究.相接行凸(connected row-convex,简称CRC)约束网络是Deville等人提出的一类易处理问题.为了给该类问题寻求有效的快速识别算法,在CRC约束网络相关工作基础上,提出了CRC约束矩阵的标准型.在分析CRC约束矩阵的标准型性质的基础上,利用行凸(row-convex,简称RC)约束网络的判定,结合PQ树(由P节点和Q节点构成的树)的性质和矩阵的索引表示法,给出了CRC约束网络的快速识别算法.该算法的时间复杂度为O(n3d2),其中,n为约束网络涉及的变量数,d为各变量的定义域中最大定义域的大小.该时间复杂度达到该类问题的最佳时间复杂度,从而为实际的CRC约束满足问题的求解提供了可行的方法. 相似文献
10.
《Journal of Parallel and Distributed Computing》2000,60(9):1103-1124
We present a simple parallel algorithm for the single-source shortest path problem in planar digraphs with nonnegative real edge weights. The algorithm runs on the EREW PRAM model of parallel computation in O((n2ε+n1−ε) log n) time, performing O(n1+ε log n) work for any 0<ε<1/2. The strength of the algorithm is its simplicity, making it easy to implement and presumable quite efficient in practice. The algorithm improves upon the work of all previous parallel algorithms. Our algorithm is based on a region decomposition of the input graph and uses a well-known parallel implementation of Dijkstra's algorithm. The logarithmic factor in both the work and the time can be eliminated by plugging in a less practical, sequential planar shortest path algorithm together with an improved parallel implementation of Dijkstra's algorithm. 相似文献
11.
《Information Processing Letters》1986,23(3):131-134
A total dominating set of a graph G is a subset S of nodes such that each node of G is adjacent to some node of S. We present an O(n2) time algorithm for finding a minimum cardinality total dominating set in an interval graph (one which represents intersecting intervals on the line) by reducing it to a shortest path problem on an appropriate acyclic directed network. 相似文献
12.
We introduce a new algorithm for computing Euclidean shortest paths in the plane in the presence of polygonal obstacles. In particular, for a given start points, we build a planar subdivision (ashortest path map) that supports efficient queries for shortest paths froms to any destination pointt. The worst-case time complexity of our algorithm isO(kn log2
n), wheren is the number of vertices describing the polygonal obstacles, andk is a parameter we call the illumination depth of the obstacle space. Our algorithm usesO(n) space, avoiding the possibly quadratic space complexity of methods that rely on visibility graphs. The quantityk is frequently significantly smaller thann, especially in some of the cases in which the visibility graph has quadratic size. In particular,k is bounded above by the number of different obstacles that touch any shortest path froms.Partially supported by NSF Grants IRI-8710858 and ECSE-8857642 and by a grant from Hughes Research Laboratories, Malibu, CA. 相似文献
13.
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given
an error parameter such that , our algorithm maintains approximate all-pairs shortest paths in an undirected planar graph G with nonnegative edge lengths. The approximate paths are guaranteed to be accurate to within a 1+ factor. The time bounds for both query and update for our algorithm is O(
-1
n
2/3
log
2
n log D) , where n is the number of nodes in G and D is the sum of its edge lengths. The time bound for the queries is worst case, while that for the additions is amortized.
Our approximation algorithm is based upon a novel technique for approximately representing all-pairs shortest paths among
a selected subset of the nodes by a sparse substitute graph.
Received January 1995; revised February 1997. 相似文献
14.
In this paper we consider the problem of finding aclosed partition in a directed graph. This problem has applications in concurrent probabilistic program verification. The best sequential algorithm known for this problem runs inO(mn) time wherem is the number of directed edges andn is the number of vertices in the given digraph. In this paper we present a linear-time sequential algorithm to solve the closed partition problem for planar digraphs that arecompact. We then build on this algorithm to obtain an O(n1.5)-time sequential algorithm to solve the closed partition problem for a general planar digraph.This work was supported in part by NSF Grant CCR 89-10707. 相似文献
15.
Summary. The purpose of compact routing is to provide a labeling of the nodes of a network and a way to encode the routing tables, so that routing can be performed
efficiently (e.g., on shortest paths) whilst keeping the memory-space required to store the routing tables as small as possible.
In this paper, we answer a long-standing conjecture by showing that compact routing may also assist in the performance of
distributed computations. In particular, we show that a network supporting a shortest path interval routing scheme allows broadcasting with a message-complexity of O(n), where n is the number of nodes of the network. As a consequence, we prove that O(n) messages suffice to solve leader-election for any graph labeled by a shortest path interval routing scheme, improving the
previous known bound of O(m+n). A general consequence of our result is that a shortest path interval routing scheme contains ample structural information to avoid developing ad-hoc or network-specific solutions for basic problems that distributed systems must handle repeatedly.
Received: December 2000 / Accepted: July 2001 相似文献
16.
《Information Sciences》1987,42(1):51-67
A generalized distance measure called m-neighbor distance in n-D quantized space is presented. Its properties as a metric are examined. It is shown to give the shortest path length between two points in n-D digital space. An algorithm for finding such a shortest path between two points is presented. It is shown that lower dimension (2-D and 3-D) distance measures presently used in digital geometry can easily be derived as special cases. Other properties of m-neighbor distance are also examined. 相似文献
17.
In this paper, we use the regular distribution method to design a perfect load balancing algorithm for an n-star with a maximum error of 1 and a time complexity of 3n(n+1). This algorithm is based on the novel notion of leader trees. A second algorithm proposed in this paper as an enhancement
to our first algorithm and uses an arbitrary spanning tree as the leader tree and has a worst time complexity of 2.25n
2−3n+0.75. We also discuss the issue of dynamically selecting the leader tree and hybrid load balancing algorithms in general.
Furthermore, we present a hybrid algorithm for load balancing on the star interconnection network which benefits from a diffusion
load balancing preprocessing phase and shows a smaller mean time complexity than our two first algorithms. 相似文献
18.
在实际交通行为中,不可避免地存在着交叉口时间延迟,而且交通管制信息如交叉口转向限制也普遍存在,这些交通特征使得常规的最短路算法难以满足车辆导航系统路线规划的要求。提出基于“节点-弧段-特征”的数据结构存储方案,能够完整描述路网的平面拓扑和交通特征属性;针对具有交叉口转向限制和交叉口延迟等特征的交通网络,首先采用对偶图方法构造等效网络,在等效网络中采用常规的最短路算法计算最优路线,然后将它转化为原道路网中的行车路线。试验证明这种方法能够有效解决包含交通特征的车辆导航系统路线规划问题. 相似文献
19.
Donald D. Chinn Tom Leighton Martin Tompa 《Journal of Parallel and Distributed Computing》1996,34(2):154
An adaptive routing algorithm is one in which the path a packet takes from its source to its destination may depend on other packets it encounters. Such algorithms potentially avoid network bottlenecks by routing packets around “hot spots.” Minimal adaptive routing algorithms have the additional advantage that the path each packet takes is a shortest one. For a large class of minimal adaptive routing algorithms, we present an Ω(n2/k2) bound on the worst case time to route a static permutation of packets on ann×nmesh or torus with nodes that can hold up tok≥ 1 packets each. This is the first nontrivial lower bound on adaptive routing algorithms. The argument extends to more general routing problems, such as theh–hrouting problem. It also extends to a large class of dimension order routing algorithms, yielding an Ω(n2/k) time bound. To complement these lower bounds, we present two upper bounds. One is anO(n2/k+n) time dimension order routing algorithm that matches the lower bound. The other is the first instance of a minimal adaptive routing algorithm that achievesO(n) time with constant sized queues per node. We point out why the latter algorithm is outside the model of our lower bounds. 相似文献
20.
In 1992 F. K. Hwang and J. F. Weng published an O(n
2
) time algorithm for computing the shortest network under a given full Steiner topology interconnecting n fixed points in the Euclidean plane. The Hwang—Weng algorithm can be used to improve substantially existing algorithms for
the Steiner minimum tree problem because it reduces the number of different Steiner topologies to be considered dramatically.
In this paper we present an improved Hwang—Weng algorithm. While the worst-case time complexity of our algorithm is still
O(n
2
) , its average time complexity over all the full Steiner topologies interconnecting n fixed points is O (n log n ).
Received August 24, 1996; revised February 10, 1997. 相似文献