Almost every graph is divergent under the biclique operator
@article{Groshaus2016AlmostEG, title={Almost every graph is divergent under the biclique operator}, author={Marina Groshaus and Andr{\'e} Luiz Pires Guedes and Leandro Montero}, journal={Discret. Appl. Math.}, year={2016}, volume={201}, pages={130-140} }
Figures from this paper
11 Citations
On the edge‐biclique graph and the iterated edge‐biclique operator
- MathematicsJ. Graph Theory
- 2022
The sufficient conditions for a graph to be convergent or divergent under the operator $KB_e$ are given and the behavior ofgeon graphs is characterized and some general conjectures on the subject are proposed.
Biclique graph of bipartite permutation graphs
- Mathematics, Computer ScienceElectron. Notes Discret. Math.
- 2017
Clique‐convergence is undecidable for automatic graphs
- MathematicsJ. Graph Theory
- 2021
The clique operator transforms a graph G into its clique graph K ( G ) , which is the intersection graph of all the (maximal) cliques of G . Iterated clique graphs are then defined by K n ( G ) = K (…
Quelques problèmes d'algorithmique et combinatoires en théorie des grapphes. (A Few Problems of Algorithm and Complexity in Graph Theory)
- Philosophy, Computer Science
- 2017
Cette these traite de differents problemes de decisions binaires ou de minimisations lies a la notion of graphe, et cherche, pour chacun of ces problemes, a determiner sa classe de complexite, ou a fournir un algorithme.
References
SHOWING 1-10 OF 46 REFERENCES
On the Iterated Biclique Operator
- MathematicsJ. Graph Theory
- 2013
A forbidden structure characterization of convergent graphs, which yield a polynomial time algorithm to decide if a given graph diverges or converges under the biclique operator.
The number of convergent graphs under the biclique operator with no twin vertices is finite
- MathematicsElectron. Notes Discret. Math.
- 2009
Equivariant collapses and the homotopy type of iterated clique graphs
- MathematicsDiscret. Math.
- 2008
Efficient Mining of Large Maximal Bicliques
- Computer Science, MathematicsDaWaK
- 2006
This paper proposes an efficient algorithm to mine large maximal biclique subgraphs from undirected graphs using a divide-and-conquer approach and shows that the proposed algorithm outperforms previous work significantly.