Registro:

Referencias:

• Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P., Simeone, B., Consensus algorithms for the generation of all maximal bicliques (2004) Discrete Appl Math, 145 (1), pp. 11-21
• Amilhastre, J., Vilarem, M.C., Janssen, P., Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs (1998) Discrete Appl Math, 86 (2-3), pp. 125-144
• Lin, G., Bondy, M.C., Durán, A., Szwarcfiter, J., Self-clique graphs and matrix permutations (2003) J Graph Theory, 44 (3), pp. 178-192
• Booth, K., Lueker, G., Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms (1976) J Comput System Sci, 13 (3), pp. 335-379
• Brandstädt, A., Le, V.B., Spinrad, J.P., (1999) Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications, , Society for industrial and Applied Mathematics SIAM, Philadelphia, PA
• Dias, M.F., de Figueiredo, C.M.H., Szwarcfiter, J.L., Generating bicliques of a graph in lexicographic order (2005) Theoret Comput Sci, 337 (1-3), pp. 240-248
• Escalante, F., Über iterierte Clique-Graphen (1973) Abh Math Sem Univ Hamburg, 39, pp. 59-68
• Fulkerson, D.R., A, O., Gross, Incidence matrices and interval graphs (1965) Pacific J Math, 15, pp. 835-855
• Gavril, F., Algorithms on circular-arc graphs (1974) Networks, 4, pp. 357-369
• Gavril, F., The intersection graphs of subtrees in trees are exactly the chordal graphs (1974) J Combinatorial Theory Ser B, 16, pp. 47-56
• Gilmore, P.C., Families of sets with faithful graph representations, 184, p. 1962. , IBM Research Note N. C
• Gilmore, P.C., Hoffman, A.J., A characterization of comparability graphs and of interval graphs (1964) Canad J Math, 16, pp. 539-548
• Golumbic, M.C., Goss, C.F., Perfect elimination and chordal bipartite graphs (1978) J Graph Theory, 2 (2), pp. 155-163
• Groshaus, M., Szwarcfiter, J.L., Biclique-Helly graphs (2007) Graphs Combinatorics, 26 (6), pp. 633-645
• Groshaus, M., Szwarcfiter, J.L., On hereditary Helly classes of graphs (2008) Discrete Math Theor Comput Sci, 10 (1), pp. 71-78
• Larrión, F., Neumann-Lara, V., Pizaña, M.A., Porter, T.D., A hierarchy of self-clique graphs (2004) Discrete Math, 282 (1-3), pp. 193-208
• Lehot, P.G.H., An optimal algorithm to detect a line graph and output its root graph (1974) J ACM, 21 (4), pp. 569-575
• McKee, T.A., McMorris, F.R., (1999) Topics in Intersection Graph Theory, SIAM Monographs on Discrete Mathematics and Applications, , Society for Industrial and Applied Mathematics SIAM, Philadelphia, PA
• Montero, L., (2008) Convergencia y divergencia del grafo biclique iterado, , Master's thesis, Departamento de Computatión, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires
• M̈ller, H., On edge perfectness and classes of bipartite graphs (1996) Discrete Math, 149 (1-3), pp. 159-187
• Peeters, R., The maximum edge biclique problem is NP-complete (2003) Discrete Appl Math, 131 (3), pp. 651-654
• E. Prisner, Bicliques in graphs. II. Recognizing K-path graphs and underlying graphs of line digraphs, In: Graph Theoretic Concepts in Computer Science (Berlin, 1997), Lecture Notes in Computer Science 1335, Springer, Berlin, 1997, pp. 273-287; Prisner, E., Bicliques in graphs. I. Bounds on their number (2000) Combinatorica, 20 (1), pp. 109-117
• Roberts, F., Spencer, J., A characterization of clique graphs (1971) J Combinatorial Theory Ser B, 10, pp. 102-108
• Tuza, Z., Covering of graphs by complete bipartite subgraphs: Complexity of 0-1 matrices (1984) Combinatorica, 4 (1), pp. 111-116
• Yannakakis, M., Node-and edge-deletion NP-complete problems (1978) STOC '78: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 253-264. , ACM, New York, NY, USA
• Yannakakis, M., Node-deletion problems on bipartite graphs (1981) SIAM J Comput, 10 (2), pp. 310-327

Citas:

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

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

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

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