共查询到20条相似文献,搜索用时 31 毫秒
1.
Lovász, Saks, and Trotter showed that there exists an on-line algorithm which will color any on-linek-colorable graph onn vertices withO(nlog(2k–3)
n/log(2k–4)
n) colors. Vishwanathan showed that at least (log
k–1
n/k
k
) colors are needed. While these remain the best known bounds, they give a distressingly weak approximation of the number of colors required. In this article we study the case of perfect graphs. We prove that there exists an on-line algorithm which will color any on-linek-colorable perfect graph onn vertices withn
10k/loglogn
colors and that Vishwanathan's techniques can be slightly modified to show that his lower bound also holds for perfect graphs. This suggests that Vishwanathan's lower bound is far from tight in the general case.Research partially supported by Office of Naval Research grant N00014-90-J-1206. 相似文献
2.
We consider linear programming relaxations for the max cut problem in graphs, based on k-gonal inequalities. We show that the integrality ratio for random dense graphs is asymptotically 1+1/k and for random sparse graphs is at least 1+3/k. There are O(nk)k-gonal inequalities. These results generalize work by Poljak and Tuza, who gave similar results for k=3. 相似文献
3.
Let ??(n, m) denote the class of simple graphs on n vertices and m edges and let G ∈ ?? (n, m). There are many results in graph theory giving conditions under which G contains certain types of subgraphs, such as cycles of given lengths, complete graphs, etc. For example, Turan's theorem gives a sufficient condition for G to contain a Kk + 1 in terms of the number of edges in G. In this paper we prove that, for m = αn2, α > (k - 1)/2k, G contains a Kk + 1, each vertex of which has degree at least f(α)n and determine the best possible f(α). For m = ?n2/4? + 1 we establish that G contains cycles whose vertices have certain minimum degrees. Further, for m = αn2, α > 0 we establish that G contains a subgraph H with δ(H) ≥ f(α, n) and determine the best possible value of f(α, n). 相似文献
4.
Summary Nested dissection is an algorithm invented by Alan George for preserving sparsity in Gaussian elimination on symmetric positive definite matrices. Nested dissection can be viewed as a recursive divide-and-conquer algorithm on an undirected graph; it usesseparators in the graph, which are small sets of vertices whose removal divides the graph approximately in half. George and Liu gave an implementation of nested dissection that used a heuristic to find separators. Lipton and Tarjan gave an algorithm to findn
1/2-separators in planar graphs and two-dimensional finite element graphs, and Lipton, Rose, and Tarjan used these separators in a modified version of nested dissection, guaranteeing bounds ofO (n logn) on fill andO(n
3/2) on operation count. We analyze the combination of the original George-Liu nested dissection algorithm and the Lipton-Tarjan planar separator algorithm. This combination is interesting because it is easier to implement than the Lipton-Rose-Tarjan version, especially in the framework of existïng sparse matrix software. Using some topological graph theory, we proveO(n logn) fill andO(n
3/2) operation count bounds for planar graphs, twodimensional finite element graphs, graphs of bounded genus, and graphs of bounded degree withn
1/2-separators. For planar and finite element graphs, the leading constant factor is smaller than that in the Lipton-Rose-Tarjan analysis. We also construct a class of graphs withn
1/2-separators for which our algorithm does not achieve anO(n logn) bound on fill.The work of this author was supported in part by the Hertz Foundation under a graduate fellowship and by the National Science Foundation under Grant MCS 82-02948The work of this author was supported in part by the National Science Foundation under Grant MCS 78-26858 and by the Office of Naval Research under Contract N00014-76-C-0688 相似文献
5.
Martin Dyer Alan Frieze Thomas P. Hayes Eric Vigoda 《Random Structures and Algorithms》2013,43(2):181-200
We study a simple Markov chain, known as the Glauber dynamics, for generating a random k ‐coloring of an n ‐vertex graph with maximum degree Δ. We prove that, for every ε > 0, the dynamics converges to a random coloring within O(nlog n) steps assuming k ≥ k0(ε) and either: (i) k/Δ > α* + ε where α*≈? 1.763 and the girth g ≥ 5, or (ii) k/Δ >β * + ε where β*≈? 1.489 and the girth g ≥ 7. Our work improves upon, and builds on, previous results which have similar restrictions on k/Δ and the minimum girth but also required Δ = Ω (log n). The best known result for general graphs is O(nlog n) mixing time when k/Δ > 2 and O(n2) mixing time when k/Δ > 11/6. Related results of Goldberg et al apply when k/Δ > α* for all Δ ≥ 3 on triangle‐free “neighborhood‐amenable” graphs.© 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013 相似文献
6.
Let C(α) denote the finite interval graphs representable as intersection graphs of closed real intervals with lengths in [1, α]. The points of increase for C are the rational α ≥ 1. The set D(α) = [∩β>αC(β)]\C(α) of graphs that appear as soon as we go past α is characterized up to isomorphism on the basis of finite sets E(α) of irreducible graphs for each rational α. With α = p/q and p and q relatively prime, ∣E(α)∣ is computed for all (p,q) with q ? 2 and p = q + 1. When q = 1, E(p) contains only the bipartite star K1, p+2. A lowr bound on ∣E(α)∣ is given for all rational α. 相似文献
7.
David Eppstein 《BIT Numerical Mathematics》1992,32(2):237-248
We give improved solutions for the problem of generating thek smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes timeO(m log(m, n)=k
2); for planar graphs this bound can be improved toO(n+k
2). We also show that thek best spanning trees for a set of points in the plane can be computed in timeO(min(k
2
n+n logn,k
2+kn log(n/k))). Thek best orthogonal spanning trees in the plane can be found in timeO(n logn+kn log log(n/k)+k
2). 相似文献
8.
Mohammad T. Hajiaghayi Guy Kortsarz Vahab S. Mirrokni Zeev Nutov 《Mathematical Programming》2007,110(1):195-208
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the
graph is the sum of the powers of the nodes of this graph. Motivated by applications in wireless multi-hop networks, we consider
four fundamental problems under the power minimization criteria: the Min-Power b-Edge-Cover problem (MPb-EC) where the goal is to find a min-power subgraph so that the degree of every node v is at least some given integer b(v), the Min-Power k-node Connected Spanning Subgraph problem (MPk-CSS), Min-Power k-edge Connected Spanning Subgraph problem (MPk-CSS), and finally the Min-Power k-Edge-Disjoint Paths problem in directed graphs (MPk-EDP). We give an O(log4
n)-approximation algorithm for MPb-EC. This gives an O(log4
n)-approximation algorithm for MPk-CSS for most values of k, improving the best previously known O(k)-approximation guarantee. In contrast, we obtain an approximation algorithm for ECSS, and for its variant in directed graphs (i.e., MPk-EDP), we establish the following inapproximability threshold: MPk-EDP cannot be approximated within O(2log1-ε
n) for any fixed ε > 0, unless NP-hard problems can be solved in quasi-polynomial time.
This paper was done when V. S. Mirrokni was at Computer Science and Artificial Intelligence Laboratory, MIT. 相似文献
9.
Small k-regular graphs of girth g where g=6,8,12 are obtained as subgraphs of minimal cages. More precisely, we obtain (k,6)-graphs on 2(kq−1) vertices, (k,8)-graphs on 2k(q2−1) vertices and (k,12)-graphs on 2kq2(q2−1), where q is a prime power and k is a positive integer such that q≥k≥3. Some of these graphs have the smallest number of vertices known so far among the regular graphs with girth g=6,8,12. 相似文献
10.
Nili Guttmann-Beck Refael Hassin 《Journal of Algorithms in Cognition, Informatics and Logic》1997,24(2):266-286
We consider the problem of partitioning the node set of a graph intopequal sized subsets. The objective is to minimize the maximum length, over these subsets, of a minimum spanning tree. We show that no polynomial algorithm with bounded error ratio can be given for the problem unless P = NP. We present anO(n2) time algorithm for the problem, wherenis the number of nodes in the graph. Assuming that the edge lengths satisfy the triangle inequality, its error ratio is at most 2p − 1. We also present an improved algorithm that obtains as an input a positive integerx. It runs inO(2(p + x)pn2) time, and its error ratio is at most (2 − x/(x + p − 1))p. 相似文献
11.
Greedily Finding a Dense Subgraph 总被引:3,自引:0,他引:3
Yuichi Asahiro Kazuo Iwama Hisao Tamaki Takeshi Tokuyama 《Journal of Algorithms in Cognition, Informatics and Logic》2000,34(2):203
Given an n-vertex graph with nonnegative edge weights and a positive integer k ≤ n, our goal is to find a k-vertex subgraph with the maximum weight. We study the following greedy algorithm for this problem: repeatedly remove a vertex with the minimum weighted-degree in the currently remaining graph, until exactly k vertices are left. We derive tight bounds on the worst case approximation ratio R of this greedy algorithm: (1/2 + n/2k)2 − O(n − 1/3) ≤ R ≤ (1/2 + n/2k)2 + O(1/n) for k in the range n/3 ≤ k ≤ n and 2(n/k − 1) − O(1/k) ≤ R ≤ 2(n/k − 1) + O(n/k2) for k < n/3. For k = n/2, for example, these bounds are 9/4 ± O(1/n), improving on naive lower and upper bounds of 2 and 4, respectively. The upper bound for general k compares well with currently the best (and much more complicated) approximation algorithm based on semidefinite programming. 相似文献
12.
We describe an algorithm for the dominating set problem with time complexity O((4g+40)kn2) for graphs of bounded genus g1, where k is the size of the set. It has previously been shown that this problem is fixed parameter tractable for planar graphs. We give a simpler proof for the previous O(8kn2) result for planar graphs. Our method is a refinement of the earlier techniques. 相似文献
13.
Clemens Fuchs 《Indagationes Mathematicae》2009,20(2):217-231
In this paper we give effective upper bounds for the degree k of divisors (over ?) of generalized Laguerre polynomials Lαn(x), i.e. of for α = −tn − s − 1 and α = tn + s with t,s ∈ ?, t = O(log k), s = O(k log k) and k sufficiently large. 相似文献
14.
Let q(x) be a real-valued function with compact support D⊂ℝ3. Given the scattering amplitude A(α′, α, k) for all α′, α∈S2 and a fixed frequency k>0, the moments of q(x) up to the second order are found using a computationally simple and relatively stable two-step procedure. First, one finds the zeroth moment (total intensity) and the first moment (centre of inertia) of the potential q. Second, one refines the above moments and finds the tensor of the second central moments of q. Asymptotic error estimates are given for these moments as d = diam(D)→0. Physically, this means that (k2+sup∣q(x))d2<1 and sup∣q(x)∣d<k. The found moments give an approximate position and the shape of the support of q. In particular, an ellipsoid D̃ and a real constant q̃ are found, such that the potential q̃ (x) = q̃, x∈D̃, and q̃ (x) = 0, x∉ D̃, produces the scattering data which fit best the observed scattering data and has the same zeroth, first, and second moments as the desired potential. A similar algorithm for finding the shape of D given only the modulus of the scattering amplitude A(α′,α) is also developed. 相似文献
15.
We study the problem of coloring graphs in an online manner. The only known deterministic online graph coloring algorithm with a sublinear performance function was found by [9.], 319–325). Their algorithm colors graphs of chromatic number χ with no more than (2χn)/log* n colors, where n is the number of vertices. They point out that the performance can be improved slightly for graphs with bounded chromatic number. For three-chromatic graphs the number of colors used, for example, is O(n log log log n/log log n). We show that randomization helps in coloring graphs online. We present a simple randomized online algorithm to color graphs with expected number of colors O(2χχ2n(χ−2)/(χ−1)(log n)1/(χ−1)). For three-colorable graphs the expected number of colors our algorithm uses is
. All our algorithms run in polynomial time. It is interesting to note that our algorithm compares well with the best known polynomial time offline algorithms. For instance, the best polynomial time algorithm known for three-colorable graphs, due to [4.] pp. 554–562). We also prove a lower bound of Ω((1/(χ − 1))((log n/(12(χ + 1))) − 1)χ−1) for the randomized model. No lower bound for the randomized model was previously known. For bounded χ, our result improves even the best known lower bound for the deterministic case: Ω((log n/log log n)χ−1), due to Noga Alon (personal communication, September 1989). 相似文献
16.
WOODALL Douglas R 《中国科学A辑(英文版)》2009,52(5):973-980
It is conjectured that χas(G) = χt(G) for every k-regular graph G with no C5 component (k 2). This conjecture is shown to be true for many classes of graphs, including: graphs of type 1; 2-regular, 3-regular and (|V (G)| - 2)-regular graphs; bipartite graphs; balanced complete multipartite graphs; k-cubes; and joins of two matchings or cycles. 相似文献
17.
Determining of a maximal network flow is a classic problem in discrete optimization with many applications. In this paper,
a new algorithm based on the Dinic’s method is presented. Algorithms of the Dinic’s method work evidently faster than theoretical
bounds for a randomized network. This paper presents a parameterized and easy to implement family of algorithms of finding
a saturating flow in a layered network. Although their common complexity is poor O(V
2
L) where L is the number of layers, three particular members are proved to be O(V
2). Furthermore, there is a particularly interesting “balanced” member of the family for which a calculated upper bound on
complexity is still O(V
2
L) but there is known no example of a layered network that needs more than O(E + V
(3/2)) time to resolve. All the considered members work really quickly for randomized examples of a layered network. Starting from
the above family, three algorithms which find maximal flow in a network in O(V
3) worst case time have been constructed, while the respective “balanced” algorithm is theoretically O(V
4). All the algorithms do not extend O(V
2) time in experimental, i.e. randomized, cases.
相似文献
18.
Streaming Algorithms for Line Simplification 总被引:1,自引:0,他引:1
M. A. Abam M. de Berg P. Hachenberger A. Zarei 《Discrete and Computational Geometry》2010,43(3):497-515
We study the following variant of the well-known line-simplification problem: we are getting a (possibly infinite) sequence
of points p
0,p
1,p
2,… in the plane defining a polygonal path, and as we receive the points, we wish to maintain a simplification of the path
seen so far. We study this problem in a streaming setting, where we only have a limited amount of storage, so that we cannot
store all the points. We analyze the competitive ratio of our algorithms, allowing resource augmentation: we let our algorithm
maintain a simplification with 2k (internal) points and compare the error of our simplification to the error of the optimal simplification with k points. We obtain the algorithms with O(1) competitive ratio for three cases: convex paths, where the error is measured using the Hausdorff distance (or Fréchet
distance), xy-monotone paths, where the error is measured using the Hausdorff distance (or Fréchet distance), and general paths, where
the error is measured using the Fréchet distance. In the first case the algorithm needs O(k) additional storage, and in the latter two cases the algorithm needs O(k
2) additional storage. 相似文献
19.
Bernhard Fuchs Walter Kern Xinhui Wang 《Mathematical Methods of Operations Research》2007,66(1):117-125
The Dreyfus–Wagner algorithm is a well-known dynamic programming method for computing minimum Steiner trees in general weighted
graphs in time O
*(3
k
), where k is the number of terminal nodes to be connected. We improve its running time to O
*(2.684
k
) by showing that the optimum Steiner tree T can be partitioned into T = T
1∪ T
2 ∪ T
3 in a certain way such that each T
i
is a minimum Steiner tree in a suitable contracted graph G
i
with less than terminals. In the rectilinear case, there exists a variant of the dynamic programming method that runs in O
*(2.386
k
). In this case, our splitting technique yields an improvement to O
*(2.335
k
). 相似文献
20.
H. A. Kierstead 《Israel Journal of Mathematics》1998,105(1):93-104
We show that for anyk, there exists an on-line algorithm that will color anyk-colorable graph onn vertices withO(n
1−1/k!
) colors. This improves the previous best upper bound ofO(nlog(2k−3)
n/log(2k−4)
n) due to Lovász, Saks, and Trotter. In the special casesk=3 andk=4 we obtain on-line algorithms that useO(n
2/3log1/3
n) andO(n
5/6log1/6
n) colors, respectively. 相似文献