A fixed-parameter tractable algorithm for matrix domination

Information Processing Letters

Volumn 90, Issue 5, 2004, Pages 267-272

  Weston, Mark ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Analysis of algorithms; Computational complexity; Graph algorithms; Parameterized complexity

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; GRAPH THEORY; MATHEMATICAL TRANSFORMATIONS; SET THEORY;

ANALYSIS OF ALGORITHMS; GRAPH ALGORITHMS; PARAMETERIZED COMPLEXITY;

MATRIX ALGEBRA;

EID: 2142841007     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2002.12.001     Document Type: Article

References (10)

1. Chen J., Kanj I.A., Jia W. Vertex cover: further observations and further improvements. J. Algorithms. 41:(2):2001;280-301.
2. Downey R.G., Fellows M.R. Parameterized Complexity. 1999;Springer, Berlin.
3. Downey R.G., Fellows M.R. Parameterized computational feasibility. Clote P., Remmel J. Feasible Mathematics II. 1995;219-244 Birkhäuser, Boston, MA.
4. Downey R.G., Fellows M.R., Stege U. A framework for systematically confronting computational intractability. Contemporary Trends in Discrete Mathematics (Stirín Castle, 1997). DIMACS Ser. Discrete Math. Theoret. Comput. Sci. vol. 49:1999;49-99 Amer. Math. Soc. Providence, RI.
5. M.R. Fellows, Personal communication, 1999.
6. Fernau H., Niedermeier R. An efficient exact algorithm for constraint bipartite vertex cover. Mathematical Foundations of Computer Science 1999 (Szklarska Poreba). Lecture Notes in Comput. Sci. vol. 1672:1999;387-397 Springer, Berlin.
7. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-completeness. 1979;Freeman, New York.
8. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2:(4):1973;225-231.
9. Lawler E.L. Combinatorial Optimization: Networks and Matroids. 1976;Holt, Rinehart and Winston.
10. Yannakakis M., Gavril F. Edge dominating sets in graphs. SIAM J. Appl. Math. 38:(3):1980;364-372.