Recognizing Sparse Perfect Elimination Bipartite Graphs, Computer science?theory and applications, pp.443-455, 2011. ,
DOI : 10.1145/276698.276710
Bisimplicial edges in bipartite graphs, Discrete Applied Mathematics, vol.161, issue.12, pp.1699-1706 ,
DOI : 10.1016/j.dam.2011.03.004
Arboricity and Subgraph Listing Algorithms, SIAM Journal on Computing, vol.14, issue.1, pp.210-223, 1985. ,
DOI : 10.1137/0214017
On the generation of bicliques of a graph, Discrete Applied Mathematics, vol.155, issue.14, pp.1826-1832, 2007. ,
DOI : 10.1016/j.dam.2007.03.017
Recognition of perfect elimination bipartite graphs, Information Processing Letters, vol.15, issue.4, pp.179-18290101, 1982. ,
DOI : 10.1016/0020-0190(82)90101-6
Perfect Elimination and Chordal Bipartite Graphs, Journal of Graph Theory, vol.5, issue.2, pp.155-163, 1978. ,
DOI : 10.1002/jgt.3190020209
Powers of tensors and fast matrix multiplication, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC '14, pp.296-303, 2014. ,
DOI : 10.1145/2608628.2608664
Arboricity, h-index, and dynamic algorithms, Theoret. Comput. Sci, vol.426427, pp.75-90 ,
Decomposition of Finite Graphs Into Forests, Journal of the London Mathematical Society, vol.1, issue.1, p.12, 1964. ,
DOI : 10.1112/jlms/s1-39.1.12
Algorithmic Aspects of Vertex Elimination on Directed Graphs, SIAM Journal on Applied Mathematics, vol.34, issue.1, pp.176-197, 1978. ,
DOI : 10.1137/0134014
Efficient graph representations, volume 19 of Fields Institute Monographs, 2003. ,
Recognizing quasi-triangulated graphs, Discrete Applied Mathematics, vol.138, issue.1-2, pp.203-213, 2004. ,
DOI : 10.1016/S0166-218X(03)00295-6
On maximal clique irreducible graphs, J. Combin. Math. Combin. Comput, vol.8, pp.187-193, 1990. ,
On characterizing weakly maximal clique irreducible graphs, Proceedings of the Thirty-Fourth Southeastern International Conference on Combinatorics, Graph Theory and Computing, pp.177-188, 2003. ,