Registro:

Referencias:

• Abello, J.M., Pardalos, P., Resende, M.G.C., On maximum clique problems in very large graphs (1999) External Memory Algorithms, 50, pp. 119-130. , DIMACS Series in Discrete Mathematics and Theoretical Computer Science American Mathematical Society Boston, MA, USA
• Albert, R., Barabási, A.-L., Statistical mechanics of complex networks (2002) Reviews of Modern Physics, 74, pp. 47-97
• Asahiro, Y., Hassin, R., Iwama, K., Complexity of finding dense subgraphs (2002) Discrete Applied Mathematics, 121, pp. 15-26
• Asahiro, Y., Iwama, K., Tamaki, H., Tokuyama, T., Greedily finding dense subgraphs (2000) Journal of Algorithms, 34, pp. 203-221
• Barabási, A.-L., Albert, R., Emergence of scaling in random networks (1999) Science, 286, pp. 509-512
• Billionnet, A., Different formulations for solving the heaviest k-subgraph problem (2005) Information Systems and Operational Research, 43 (3), pp. 171-186
• Bonomo, F., Marenco, J., Saban, D., Stier-Moses, N.E., A polyhedral study of the maximum edge subgraph problem (2009) Proceedings of the v Latin-American Algorithms, Graphs and Optimization Symposium, LAGOS'09, 35, pp. 197-202. , Gramado, Brazil, in: Electronic Notes in Discrete Mathematics
• Corneil, D., Perl, Y., Clustering and domination in perfect graphs (1984) Discrete Applied Mathematics, 9, pp. 27-39
• Edmonds, J., Maximum matching and a polyhedron with (0, 1)-vertices (1965) Journal of Research of the National Bureau of Standards, 69, pp. 125-130
• Edmonds, J., Paths, trees, and flowers (1965) Canadian Journal of Mathematics, 17, pp. 449-467
• Erds, P., Rényi, A., On random graphs (1959) Publicationes Mathematicae, 6, pp. 290-297
• Feige, U., Kortsarz, G., Peleg, D., The dense k-subgraph problem (2001) Algorithmica, 29 (3), pp. 410-421
• Fischetti, M., Hamacher, H., Jornsten, K., Maffioli, F., Weighted k-cardinality trees: Complexity and polyhedral structure (1994) Networks, 24, pp. 11-21
• Hagberg, A.A., Schult, D.A., Swart, P.J., Exploring network structure, dynamics, and function using NetworkX (2008) Proceedings of the 7th Python in Science Conference, SciPy'08, pp. 11-15. , Pasadena, CA, USA, August
• Han, Q., Ye, Y., Zhang, J., Approximation of dense-k-subgraph (2000) Technical Report, , Department of Management Sciences, Henry B. Tippie College of Business, the University of Iowa
• Jünger, M., Thienel, S., The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (2000) Software: Practice and Experience, 30, pp. 1325-1352
• Johnson, E., Mehrotra, A., Nemhauser, G., Min-cut clustering (1993) Mathematical Programming, 62, pp. 133-151
• Johnson, D.S., Trick, M.A., (1996) Cliques, Coloring, and Satisfiability: Second Dimacs Implementation Challenge, 26. , October 11-13, 1993 DIMACS Series in Discrete Mathematics and Theoretical Computer Science American Mathematical Society Providence, RI
• Liazi, M., Milis, I., Pascual, F., Zissimopoulos, V., The densest k-subgraph problem on clique graphs (2007) Journal of Combinatorial Optimization, 14 (4), pp. 465-474
• Liazi, M., Milis, I., Zissimopoulos, V., A constant approximation algorithm for the densest k-subgraph problem on chordal graphs (2008) Information Processing Letters, 108 (1), pp. 29-32
• Mehrotra, A., Cardinality constrained Boolean quadratic polytope (1997) Discrete Applied Mathematics, 79, pp. 137-154
• Padberg, M., The boolean quadric polytope: Some characteristics, facets and relatives (1989) Mathematical Programming, 45 (1), pp. 139-172
• Roupin, F., Billionnet, A., A deterministic approximation algorithm for the densest k-subgraph problem (2008) International Journal of Operational Research, 3 (3), pp. 301-314
• Saban, D., Bonomo, F., Stier-Moses, N.E., Analysis and models of bilateral investment treaties using a social networks approach (2010) Physica A: Statistical Mechanics and Its Applications, 389, pp. 3661-3673
• Sherali, H., Cole Smith, J., A polyhedral study of the generalized vertex packing problem (2006) Mathematical Programming, 107 (3), pp. 367-390
• Wasserman, S., Faust, K., (1994) Social Network Analysis: Methods and Applications, 8. , Structural Analysis in the Social Sciences Cambridge University Press

Citas:

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

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

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

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