Registro:

Referencias:

• Björklund, A., Determinant sums for undirected hamiltonicity (2010) Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 173–182 (Washington, DC, USA), FOCS ’10, IEEE Computer Society
• Björklund, A., Husfeldt, T., Exact graph coloring using inclusion-exclusion (2008) Encyclopedia of Algorithms, , Kao M-Y, (ed), Springer, Berlin
• Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M., Fourier meets mobius: fast subset convolution (2007) Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing (New York, NY, USA), STOC ’07, ACM, pp. 67-74
• Blank, M., An estimate of the external stability of a graph without pendant vertices (1973) Prikl. Math. Programmirovanie, 10, pp. 3-11
• Brandstädt, A., Hundt, C., Nevries, R., Efficient edge domination on hole-free graphs in polynomial time (2010) Proceedings of the 9th Latin American Conference on Theoretical Informatics, pp. 650–661 (Berlin, Heidelberg), LATIN’10, Springer
• Brandstädt, A., Leitert, A., Rautenbach, D., Efficient dominating and edge dominating sets for graphs and hypergraphs (2012) Chao, K.-M., Hsu, T., Lee, D.-T. (eds.) ISAAC, Lecture Notes in Computer Science, vol. 7676, pp. 267–277. Springer
• Brandstädt, A., Lozin, V.V., On the linear structure and clique-width of bipartite permutation graphs (2003) Ars Comb., 67, pp. 273-281
• Brandstädt, A., Mosca, R.: Dominating induced matchings for P7 -free graphs in linear time. In: Asano, T., Nakano, S.-I., Okamoto, Y., Watanabe, O. (eds.) ISAAC, Lecture Notes in Computer Science, vol. 7074, pp. 100–109. Springer (2011); Cardoso, D.M., Korpelainen, N., Lozin, V.V., On the complexity of the dominating induced matching problem in hereditary classes of graphs (2011) Discrete Appl. Math., 159 (7), pp. 521-531
• Cardoso, D.M., Cerdeira, J.O., Delorme, C., Silva, P.C., Efficient edge domination in regular graphs (2008) Discrete Appl. Math., 156 (15), pp. 3060-3065
• Cardoso, D.M., Lozin, V.V., Dominating induced matchings (2009) Lipshteyn, M., Levit, V.E., McConnell, R.M. (eds.) Graph Theory, Computational Intelligence and Thought, Lecture Notes in Computer Science, vol. 5420, pp. 77–86. Springer
• Cygan, M., Pilipczuk, M., Even faster exact bandwidth (2012) ACM Trans. Algorithms, 8 (1), p. 8
• Dahllöf, V., Jonsson, P., An algorithm for counting maximum weighted independent sets and its applications (2002) SODA, pp. 292-298. , Eppstein D, (ed), ACM/SIAM, Philadelphia
• Dahllöf, V., Jonsson, P., Wahlström, M., Counting models for 2SAT and 3SAT formulae (2005) Theor. Comput. Sci., 332 (1-3), pp. 265-291
• Fomin, F.V., Gaspers, S., Saurabh, S., Stepanov, A.A., On two techniques of combining branching and treewidth (2009) Algorithmica, 54 (2), pp. 181-207
• Fomin, F.V., Kratsch, D., (2010) Exact Exponential Algorithms, , Texts in Theoretical Computer Science. Springer, Berlin
• Grinstead, D.L., Slater, P.J., Sherwani, N.A., Holmes, N.D., Efficient edge domination problems in graphs (1993) Inf. Process. Lett., 48 (5), pp. 221-228
• Gupta, S., Raman, V., Saurabh, S., Maximum r-regular induced subgraph problem: fast exponential algorithms and combinatorial bounds (2012) SIAM J. Discrete Math., 26 (4), pp. 1758-1780
• Iwata, Y., A faster algorithm for dominating set analyzed by the potential method (2011) Marx, D., Rossmanith, P. (eds.) Parameterized and Exact Computation—6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6–8, 2011. Revised Selected Papers, Lecture Notes in Computer Science, vol. 7112, pp. 41–54. Springer
• Korpelainen, N., A polynomial-time algorithm for the dominating induced matching problem in the class of convex graphs (2009) Electron. Notes Discrete Math., 32, pp. 133-140
• Lin, M.C., Mizrahi, M.J., Szwarcfiter, J.L., Exact algorithms for dominating induced matchings (2013) CoRR abs/1301, p. 7602
• Lin, M.C., Mizrahi, M.J., Szwarcfiter, J.L., An O*(1.1939 n) time algorithm for minimum weighted dominating induced matching (2013) Cai, L., Cheng, S.-W., Lam, T.W. (eds.) ISAAC, Lecture Notes in Computer Science, vol. 8283, pp. 558–567. Springer
• Livingston, M., Stout, Q.F., Distributing resources in hypercube computers (1988) Proceedings of the Third Conference on Hypercube Concurrent Computers and Applications: Architecture, Software, Computer Systems, and General Issues, vol. 1, pp. 222-231. , New York, NY, USA: C3P, ACM
• Lu, C.L., Ko, M.-T., Tang, C.Y., Perfect edge domination and efficient edge domination in graphs (2002) Discrete Appl. Math., 119 (3), pp. 227-250
• Lu, C.L., Tang, C.Y., Solving the weighted efficient edge domination problem on bipartite permutation graphs (1998) Discrete Appl. Math., 87 (1-3), pp. 203-211
• Milanic, M., Hereditary efficiently dominatable graphs (2013) J. Graph Theory, 73 (4), pp. 400-424
• Ore, O., Theory of graphs (1962) Am. Math. Soc. Colloq. Publ, p. 38
• Reed, B.A., Paths, stars and the number three (1996) Comb. Probab. Comput., 5, pp. 277-295
• Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I., A new algorithm for generating all the maximal independent sets (1977) SIAM J. Comput., 6 (3), pp. 505-517
• van Rooij, J.M.M., Nederlof, J., van Dijk, T.C., Inclusion/exclusion meets measure and conquer (2009) Fiat, A., Sanders, P. (eds.) ESA, Lecture Notes in Computer Science, vol. 5757, pp. 554–565. Springer
• Wahlström, M., A tighter bound for counting max-weight solutions to 2sat instances (2008) Proceedings of the 3rd International Conference on Parameterized and Exact Computation, pp. 202–213 (Berlin, Heidelberg). IWPEC’08, Springer
• Gerhard, J., (2003) Woeginger, Combinatorial optimization–Eureka, You Shrink!, , Springer-Verlag New York Inc., New York
• Xiao, M., Nagamochi, H., Exact algorithms for dominating induced matching based on graph partition (2015) Discrete Appl. Math., 190-191, pp. 147-162

Citas:

---------- APA ----------

---------- CHICAGO ----------

---------- MLA ----------

---------- VANCOUVER ----------