Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-21T16:46:36.402Z Has data issue: false hasContentIssue false
  • English
  • Français

Finding an Unknown Acyclic Orientation of a Given Graph

Published online by Cambridge University Press:  09 July 2009

OLEG PIKHURKO
OLEG PIKHURKO*
Affiliation:
Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213, USA (web: http://www.math.cmu.edu/~pikhurko)
Get access Rights & Permissions [Opens in a new window]

Abstract

Let c(G) be the smallest number of edges we have to test in order to determine an unknown acyclic orientation of the given graph G in the worst case. For example, if G is the complete graph on n vertices, then c(G) is the smallest number of comparisons needed to sort n numbers.

We prove that c(G) ≤ (1/4 + o(1))n2 for any graph G on n vertices, answering in the affirmative a question of Aigner, Triesch and Tuza [Discrete Mathematics144 (1995) 3–10]. Also, we show that, for every ϵ > 0, it is NP-hard to approximate the parameter c(G) within a multiplicative factor 74/73 − ϵ.

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 19 , Issue 1 , January 2010 , pp. 121 - 131
Copyright
Copyright © Cambridge University Press 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Aigner, M. (1988) Combinatorial Search, Wiley–Teubner Series in Computer Science, Wiley, Chichester.Google Scholar
[2]Aigner, M., Triesch, E. and Tuza, Z. (1995) Searching for acyclic orientations of graphs. Discrete Math. 144 3–10.CrossRefGoogle Scholar
[3]Alon, N. and Tuza, Z. (1995) The acyclic orientation game on random graphs. Random Struct. Alg. 6 261–268.CrossRefGoogle Scholar
[4]Bollobás, B. (1998) Modern Graph Theory, Springer, Berlin.CrossRefGoogle Scholar
[5]Bollobás, B. and Rosenfeld, M. (1981) Sorting in one round. Israel J. Math. 38 154–160.CrossRefGoogle Scholar
[6]Chernoff, H. (1952) A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Statist. 23 493–507.CrossRefGoogle Scholar
[7]Diestel, R. (2006) Graph Theory, 3rd edn, Springer, Berlin.Google Scholar
[8]Erdős, P. (1967) Some recent results on extremal problems in graph theory: Results. In Theory of Graphs (Rome 1966), Gordon and Breach, New York; pp. 117–123 (English); pp. 124–130 (French).Google Scholar
[9]Ford, L. R. and Johnson, S. M. (1959) A tournament problem. Amer. Math. Monthly 66 387–389.CrossRefGoogle Scholar
[10]Gasarch, W., Golub, E. and Kruskal, C. (2003) Constant time parallel sorting: An empirical view. J. Comput. Syst. Sci. 67 63–91.CrossRefGoogle Scholar
[11]Häggkvist, R. and Hell, P. (1981) Parallel sorting with constant time for comparisons. SIAM J. Comput. 10 465–472.CrossRefGoogle Scholar
[12]Håstad, J. (1999) Some optimal inapproximability results. In Proc. 29th ACM Symposium on Theory of Computing (El Paso 1997), pp. 1–10. ACM, New York.CrossRefGoogle Scholar
[13]Håstad, J. (2001) Some optimal inapproximability results. J. Assoc. Comput. Mach. 48 798–859.CrossRefGoogle Scholar
[14]Jiang, T. (2008) Personal communication.Google Scholar
[15]Knuth, D. E. (1973) The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley.Google Scholar
[16]Krivelevich, M. and Sudakov, B. (2006) Pseudo-random graphs. In More Sets, Graphs and Numbers, Vol. 15 of Bolyai Society Mathematical Studies, Springer, Berlin, pp. 199–262.CrossRefGoogle Scholar
[17]Manber, U. and Tompa, M. (1981) The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem. In Proc. 22nd Annual Symposium on Foundations of Computer Science (Nashville 1981), IEEE Computer Society Press, pp. 220–227.Google Scholar
[18]Manber, U. and Tompa, M. (1984) The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem. SIAM J. Comput. 13 109–115.CrossRefGoogle Scholar
[19]Mantel, W. (1907) Problem 28. Winkundige Opgaven 10 60–61.Google Scholar
[20]Moon, J. W. and Moser, L. (1962) On a problem of Turán. Publ. Math. Inst. Hungar. Acad. Sci. 7 283–287.Google Scholar
[21]Peczarski, M. (2002) Sorting 13 elements requires 34 comparisons. In Proc. 10th Annual European Symposium on Algorithms, Vol. 2461 of Lecture Notes in Computer Science, Springer, Berlin, pp. 785–794.Google Scholar
[22]Peczarski, M. (2004) New results in minimum-comparison sorting. Algorithmica 40 133–145.CrossRefGoogle Scholar
[23]Ruzsa, I. Z. and Szemerédi, E. (1978) Triple systems with no six points carrying three triangles. In Combinatorics II (Hajnal, A. and Sós, V., eds), North-Holland, Amsterdam, pp. 939–945.Google Scholar
[24]Simonovits, M. (1968) A method for solving extremal problems in graph theory, stability problems. In Theory of Graphs (Tihany 1966), Academic Press, pp. 279–319.Google Scholar
[25]Szemerédi, E. (1976) Regular partitions of graphs. In Proc. Colloq. Int. CNRS, Paris, pp. 309–401.Google Scholar
[26]Trevisan, L., Sorkin, G. B., Sudan, M. and Williamson, D. P. (1996) Gadgets, approximation, and linear programming. In Proc. 37th Annual Symposium on Foundations of Computer Science (Burlington 1996), IEEE Computer Society Press, Los Alamitos, CA, pp. 617–626.Google Scholar
[27]Trevisan, L., Sorkin, G. B., Sudan, M. and Williamson, D. P. (2000) Gadgets, approximation, and linear programming. SIAM J. Comput. 29 2074–2097.CrossRefGoogle Scholar
[28]Turán, P. (1941) On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok 48 436–452.Google Scholar
[29]Tuza, Z. (2001) Unsolved combinatorial problems. BRICS Lecture Series, LS-01-1. Available from: http://www.brics.dk/publications/.Google Scholar
[30]Valiant, L. G. (1975) Parallelism in comparison problems. SIAM J. Comput. 4 348–355.CrossRefGoogle Scholar