Crossings and permutations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3843 LNCS, Issue , 2006, Pages 1-12

  Biedl, Therese ^a   Brandenburg, Franz J ^b   Deng, Xiaotie ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF PASSAU   (Germany)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

METADATA; PROBLEM SOLVING; SEARCH ENGINES; SPAMMING;

CROSSINGS; PERMUTATIONS; RANK AGGREGATION PROBLEMS;

SET THEORY;

EID: 33745651383     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11618058_1     Document Type: Conference Paper

References (22)

1. N. Ailon, M. Charikar, and A. Newman. Aggregating inconsistent information: ranking and clustering. STOC (2005), 684-693.
2. J.P. Barthelemy, A. Guenoche, and O. Hudry. Median linear orders: heuristics and a branch and bound algorithm. Europ. J. Oper. Res. 42, (1989), 313-325.
3. J. Bartholdi III, C.A. Tovey, and M.A. Trick. Voting schemes for which it can be difficult to tell who won the election. Soc. Choice Welfare 6, (1989), 157-165.
4. I. Charon, A. Guenoche, O. Hudry, and F. Woirgard. New results on the computation of median orders. Discrete Math. 165/166 (1997), 139-153.
5. F.Y.L. Chin, X. Deng, Q. Feng, and S. Zhu. Approximate and dynamic rank aggregation. Theoret. Comput. Sci. 325, (2004), 409-424.
6. C. Demetrescu and I. Finochi. Breaking cycles for minimizing crossings. Electronic J. Algorithm Engineering 6, No. 2, (2001).
7. P. Diaconis and R. Graham. Spearman's footrule as a measure for disarray. Journal of the Royal Statistical Society, Series B, 39, (1977), 262-268.
8. G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, (1999).
9. C. Dwork, R. Kumar, M. Noar, and D. Sivakumar, Rank aggregation methods for the Web. Proc. WWW10 (2001), 613-622.
10. P. Eades and N.C. Wormald. Edge crossings in drawings of bipartite graphs. Algorithmica 11, (1994), 379-403.
11. G. Even, J. Naor, B. Schieber, and M. Sudan. Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20, (1998), 151-174.
12. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco, (1979).
13. M.R. Garey and D.S. Johnson. Crossing number is NP-complete. SIAM J. Alg. Disc. Meth. 4, (1983), 312-316.
14. M. Jünger and P. Mutzel. 2-layer straightline crossing minimization: performance of exact and heuristic algorithms. J. Graph Alg. Appl. 1, (1997), 1-25.
15. M. Kaufmann and D. Wagner (Eds.). Drawing Graphs: Methods and Models, LNCS 2025, (2001).
16. J. G. Kemeny. Mathematics without numbers. Daedalus 88, (1959), 577-591.
17. X. Munos, W. Unger, and I. Vrto. One sided crossing minimization is NP-hard for sparse graphs. Proc. GD 2001, LNCS 2265, (2002), 115-123.
18. J.W. Moon. Topics on Tournaments. Holt, New York (1968).
19. H. Nagamochi. An Improved approximation to the One-Sided Bilayer Drawing. Discr. Comp. Geometry 33(4), (2005), 569-591.
20. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems structures. IEEE Trans. SMC 11, (1981), 109-125.
21. V. Waddle and A. Malhotra An E log E line crossing algorithm for leveled graphs. Proc. GD 99, LNCS 1731 (2000), 59-70.
22. A. Yamaguchi and A. Sugimoto. An approximation algorithm for the two-layered graph drawing problem. Discrete Comput. Geom. 33, (2005), 565-591.