Some parameterized problems on digraphs

Computer Journal

Volumn 51, Issue 3, 2008, Pages 363-371

  Gutin, Gregory ^a,b   Yeo, Anders ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

Diagraphs; Parameterized algorithm

Indexed keywords

COMPUTATIONAL COMPLEXITY; PARAMETERIZATION; PROBLEM SOLVING; THEOREM PROVING;

ARC SET PROBLEMS; DIGRAPHS; DIRECTED K-LEAF PROBLEMS; FEEDBACK VERTEX; PARAMETERIZED ALGORITHM;

GRAPH THEORY;

EID: 43249092148     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxm039     Document Type: Article

References (51)

1. Raman, V. and Sikdar, S. Parameterized complexity of the induced subgraph problem in directed graphs. Manuscript (2006).
2. Alon, N., Fomin, F., Gutin, G., Krivelevich, M. and Saurabh, S. Parameterized Algorithms for Directed Maximum Leaf Problems. Proc. ICALP 2007, Lecture Notes in Computer Science, Vol. 4596, 352-362.
3. Downey, R. G. and Fellows, M. R. (1999) Parameterized Complexity. Springer-Verlag, New York.
4. Flum, J. and Grohe, M. (2006) Parameterized Complexity Theory. Springer.
5. Niedermeier, R. (2006) Invitation to Fixed-Parameter Algorithms. Oxford University Press.
6. Leiserson, C. E. and Saxe, J. B. (1991) Retiming synchronous circuitry. Algoritmica, 6, 5-35.
7. Kunzmann, A. and Wunderlich, H. J. An analytical approach to the partial scan problem. J. Electron. Test., Theory Appl., 1, 163-174.
8. Bang-Jensen, J. and Gutin, G. (2000) Digraphs: Theory, Algorithms and Applications. Springer-Verlag, London.
9. Karp, R. M. (1972) Reducibility among combinatorial problems. Proc. Symp. complexity of computer computations. IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 85-103. Plenum, New York.
10. Gavril, F. (1977) Some NP-complete problems on graphs. Proc. 11th Conf. Information Sciences and Systems, 91-95, John Hopkins University, Baltimore, MD.
11. Bang-Jensen, J. and Thomassen, C. (1992) A polynomial algorithm for the 2-path problem for semi-complete digraphs. SIAM J. Discret. Math. 5 366-376
12. Garey, M. R. and Johnson, D. R. (1979) Computers and Intractability W. H. Freeman and Company, New York.
13. Ailon, N., Charikar, M. and Newman, A. (2005) Aggregating inconsistent information: Ranking and clusstering. Proc. 37th STOC, pp. 684-693, ACM Press.
14. Alon, N. Ranking tournaments. SIAM J. Discrete Math., 20, 137-142.
15. Charbit, P., Thomasse, S. and Yeo, A. The minimum feedback arc set problem is NP-hard for tournaments. Combinatorics, Probability and Comput., 16, 1-4.
16. Conitzer, V. (2005) Computing Slater rankings using similarities among candidates. Technical Report RC23748, IBM Thomas J. Watson Research Center. Yorktown Heights, NY.
17. Lucchesi, C. L. (1976) A minimumax equality for directed graphs. PhD Thesis, University of Waterloo, Canada.
18. Fellows, M., Hallett, M. and Siege, U. (.2003) Analogs and duals of the MAST problem for sequences and trees. J. Algorithms, 49, 192-216.
19. Raman, V. (1997) Parameterized complexity. Proc. 7th National Seminar Theoret. Comput. Sci., Chennai, India, pp. 1-18.
20. Erdo, P. and Posa, L. (1962) On the maximal number of disjoint circuits of a graph. Publ. Math. Debrecen. 9, 3-12.
21. Itai, A. and Rodeh, M. (1978) Finding a minimum circuit in a graph. SIAM J. Comput., 7, 413-423.
22. 3) FPT algorithm for the undirected feedback vertex set problem. Proc. 11th Annual International Computing and Combinatorics Conference (COCOON 2005), Lecture Notes in Computer Science, Vol. 3595, 859-869.
23. Guo, J., Gramm, J., Hüffner, F., Niedermeier, R. and Wernicke, S. (2005) Improved fixed-parameter algorithms for two feedback set problems. Proc. 9th Workshop on Algorithms and Data Structures (WADS 2005), Lecture Notes in Computer Science, Vol. 3608, 158-168.
24. Raman, V. and Saurabh, S. (2006) Parameterized complexity of feedback set problems and their duals in tournaments. Theor. Comput. Sci., 351, 446-458.
25. Dom, M., Guo, J., Hüffner, F., Niedermeier, R. and Truß, A. (2006) Fixed-Parameter tractability results for feedback set problems in tournaments. Proc. 6th Conference on Algorithms and Complexity (CIAC 2006), Lecture Notes in Computer Sci., 3998, 320-331.
26. Truß, A. (2005) Parameterized algorithms for feedback set problems in tournaments [in German]. Diplomarbeit, Institut für Informatik, Friedrich-Schiller-Univerität Jena.
27. Fernau, H. (2005) Parameterized Algorithmics: A Graph-Theoretic Approach. Habilitationsschritt, Universität Tübingen, Germany.
28. Bang-Jensen, J. (1990) Locally semicomplete digraphs: A generalization of tournaments. J. Graph Theory, 14, 371-390.
29. Bermond, J. C., Germa, A., Heydemann, M. C. and Sotteau, D. (1980) Girth in digraphs. J. Graph Theory, 4, 337-341.
30. Younger, D. H. (1973) Graphs with interlinked directed circuits. Proc. Midwest Symp. on Circuit Theory, Vol. 2, pp. XVI 2.1-XVI 2.7.
31. Reed, B., Robertson, N., Seymour, P. D. and Thomas, R. (1996) Packing directed circuits. Combinatorica, 16, 535-554.
32. Grohe, M. and Grüber, M. Parameterized approximability of the disjoint cycle problem. Proc. ICALP 2007, Lecture Notes in Computer Science, 4596.
33. Slivkins, A. (2003) Parameterized Tractability of edge-disjoint paths on directed acyclic graphs. Proc. 11th Annual European Symposium on Algorithms (ESA 2003), Lecture Notes in Computer Science, 2832, 482-493.
34. Kirvesoja, H. (2001) Experimental ergonomic evaluation with user trials: EEE product development procedures. PhD Thesis, University of Oulu, Finland.
35. Rosenberger, R. S., Peterson, G. L. and Loomis, J. B. (2002) Applying a method of paired comparisons to measure economic values for multiple goods sets. J. Agric. Appl. Econ., 34, 215-229.
36. Strens, M. J. A. and Moore, A. W. (2003) Policy search using paired comparisons. J. Mach. Learn. Res., 3, 921-950.
37. Kano, M. and Sakamoto, A. (1983) Ranking the vertices of a weighted digraph using the legnth of forward arcs. Networks, 13, 143-151.
38. Kano, M. and Sakamoto, A. (1985) Ranking the vertices of a paired comparison digraph. SIAM J. Algebr. Discret. Methods, 6, 79-92.
39. Guo, J., Hüffner, F. and Niedermeier, R. (2004) A structural view on parameterizing problems: Distance from triviality. Proc. International Workshop on Parameterized and Exact Computation (IWPEC 2004), Lecture Notes in Computer Science, Vol. 3162, 162-173.
40. Kano, M. (1987) Ranking the vertices of an r-partite paired comparison digraph. Dicret. Appl. Math., 17, 245-253.
41. Gramm, J., Guo, J., Hüffner, F. and Niedermeier, R. (2003) Graph-modeled data clustering: Fixed-parameter algorithms for clique generation. Proc. 5th Conference on Algorithms and Complexity (CIAC 2003), Lecture Notes in Computer Science, Vol. 2653, 108-119.
42. Gutin, C. and Yeo, A. (1996) Ranking the vertices of a complete multipartite paired comparison digraph. Discret. Appl. Math., 69, 75-82.
43. Gutin, G., Rafiey, A., Szeider, S. and Yeo, A. The linear arrangement problem parameterized above guaranteed value. Theory of Computing Systems. To appear.
44. Bodlaender, H. L. (1993) On linear time minor tests and depth-first search. J. Algorithms, 14, 1-23.
45. Bonsma, P. S., Bruggermann, T. and Woeginger, G. J. (2003) A faster FPT algorithm for finding spanning trees with many leaves. Proc. 28th Int. Symp. Mathematical Foundations of Computer Science (MFCS 2003), Lecture Notes in Computer Science, Vol. 2747, 259-269.
46. Fellows, M. R. and Langston, M. A. (1992) On well-partial-order theory and its applications to combinatorial problems of VLSI design. SIAM J. Discret. Math., 5, 117-126.
47. Alon, N., Yuster, R. and Zwick, U. (1994) Color-coding: A new method for finding simple paths, cycles and other small subgraphs within large graphs. Proc. Symp. Theory of Computing (STOC), pp. 326-335. ACM.
48. Alon, N., Yuster, R. and Zwick, U. (1997) Finding and counting given length cycles. Algorithmica, 17, 209-223.
49. Gutin, G., Kloks, T., Lee, C. M. and Yeo, A. (2005) Kernels in planar digraphs. J. Comput. Syst. Sci., 71, 174-184.
50. Kühn, D. and Osthus, D. Linkidness and oriented cycles in digraphs. Submitted.
51. Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A. S. and Upfal, E. (2000) The Web as a graph. Proc. 19th ACM SIGACT-SIGMOND-AIGART Symp. Principles of Database Systems, PODS, pp. 1-10.