Some Parameterized Problems On Digraphs
暂无分享,去创建一个
[1] Andrew W. Moore,et al. Policy Search using Paired Comparisons , 2003, J. Mach. Learn. Res..
[2] Michael R. Fellows,et al. An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem , 2005, COCOON.
[3] Stefan Szeider,et al. The Linear Arrangement Problem Parameterized Above Guaranteed Value , 2007, Theory of Computing Systems.
[4] Anne Germa,et al. Girth in digraphs , 1980, J. Graph Theory.
[5] Gerhard J. Woeginger,et al. A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves , 2003, MFCS.
[6] Gregory Gutin,et al. Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph , 1996, Discret. Appl. Math..
[7] Bruce A. Reed,et al. Packing directed circuits , 1996, Comb..
[8] Hans L. Bodlaender,et al. On Linear Time Minor Tests with Depth-First Search , 1993, J. Algorithms.
[9] Private Communications , 2001 .
[10] Martin Grohe,et al. Parameterized Approximability of the Disjoint Cycle Problem , 2007, ICALP.
[11] Noga Alon,et al. Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs , 1994, STOC '94.
[12] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[13] Mikio Kano,et al. Ranking the vertices of an r-partite paired comparison digraph , 1987, Discret. Appl. Math..
[14] Rolf Niedermeier,et al. Improved Fixed-Parameter Algorithms for Two Feedback Set Problems , 2005, WADS.
[15] Venkatesh Raman,et al. Parameterized complexity of the induced subgraph problem in directed graphs , 2007, Inf. Process. Lett..
[16] Noga Alon,et al. Finding and counting given length cycles , 1997, Algorithmica.
[17] Jørgen Bang-Jensen,et al. Locally semicomplete digraphs: A generalization of tournaments , 1990, J. Graph Theory.
[18] Saket Saurabh,et al. Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments , 2004, IWPEC.
[19] Heli Kirvesoja,et al. Experimental ergonomic evaluation with user trials: EEE product development procedures , 2001 .
[20] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[21] C. Q. Lee,et al. The Computer Journal , 1958, Nature.
[22] Alon Itai,et al. Finding a minimum circuit in a graph , 1977, STOC '77.
[23] Charles E. Leiserson,et al. Retiming synchronous circuitry , 1988, Algorithmica.
[24] Carsten Thomassen,et al. A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs , 1992, SIAM J. Discret. Math..
[25] Tsuyoshi Nishimura,et al. Short cycles in digraphs , 1988, Discret. Math..
[26] Rolf Niedermeier,et al. Invitation to Fixed-Parameter Algorithms , 2006 .
[27] Vincent Conitzer,et al. Computing Slater Rankings Using Similarities among Candidates , 2006, AAAI.
[28] P. Erd Os,et al. On the maximal number of disjoint circuits of a graph , 2022, Publicationes Mathematicae Debrecen.
[29] Henning Fernau,et al. 2 Contents , 1996 .
[30] Rolf Niedermeier,et al. A Structural View on Parameterizing Problems: Distance from Triviality , 2004, IWPEC.
[31] Noga Alon,et al. Parameterized Algorithms for Directed Maximum Leaf Problems , 2007, ICALP.
[32] Michael R. Fellows,et al. On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design , 1989, SIAM J. Discret. Math..
[33] Jeffrey D. Ullman,et al. Principles of Database Systems , 1980 .
[34] Rolf Niedermeier,et al. Fixed-parameter tractability results for feedback set problems in tournaments , 2010, J. Discrete Algorithms.
[35] Mikio Kano,et al. Ranking the vertices of a weighted digraph using the length of forward arcs , 1983, Networks.
[36] Eli Upfal,et al. The Web as a graph , 2000, PODS.
[37] Arno Kunzmann,et al. An analytical approach to the partial scan problem , 1990, J. Electron. Test..
[38] M. Kano,et al. Ranking the vertices of a paired comparison digraph with normal completeness theorems , 1983 .
[39] John B. Loomis,et al. Applying a Method of Paired Comparisons to Measure Economic Values for Multiple Goods Sets , 2002, Journal of Agricultural and Applied Economics.
[40] Anders Yeo,et al. The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments , 2006, Combinatorics, Probability and Computing.
[41] Gregory Gutin,et al. Digraphs - theory, algorithms and applications , 2002 .
[42] Noga Alon,et al. Ranking Tournaments , 2006, SIAM J. Discret. Math..
[43] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[44] Gregory Gutin,et al. Kernels in planar digraphs , 2005, J. Comput. Syst. Sci..
[45] Rolf Niedermeier,et al. Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation , 2003, CIAC.
[46] Hans L. Bodlaender,et al. On Linear Time Minor Tests and Depth First Search , 1989, WADS.
[47] Michael R. Fellows,et al. Analogs and Duals of the MAST Problem for Sequences and Trees , 1998, ESA.
[48] Aleksandrs Slivkins,et al. Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs , 2003, SIAM J. Discret. Math..
[49] Saket Saurabh,et al. Parameterized algorithms for feedback set problems and their duals in tournaments , 2006, Theor. Comput. Sci..