Biclique graphs and biclique matrices (Q5189236): Difference between revisions

@@ Property / cites work @@
+Consensus algorithms for the generation of all maximal bicliques
+Normal rank
@@ Property / cites work @@
+Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
+Normal rank
@@ Property / cites work @@
+Self‐clique graphs and matrix permutations
@@ Property / cites work: Self‐clique graphs and matrix permutations / rank @@
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+Generating bicliques of a graph in lexicographic order
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms on circular-arc graphs
@@ Property / cites work: Algorithms on circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+Normal rank
@@ Property / cites work @@
+A Characterization of Comparability Graphs and of Interval Graphs
+Normal rank
@@ Property / cites work @@
+Perfect Elimination and Chordal Bipartite Graphs
@@ Property / cites work: Perfect Elimination and Chordal Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Biclique-Helly graphs
@@ Property / cites work: Biclique-Helly graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5387731
@@ Property / cites work: Q5387731 / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
+Normal rank
@@ Property / cites work @@
+The maximum edge biclique problem is NP-complete
@@ Property / cites work: The maximum edge biclique problem is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Bicliques in graphs. I: Bounds on their number
@@ Property / cites work: Bicliques in graphs. I: Bounds on their number / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of clique graphs
@@ Property / cites work: A characterization of clique graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
+Normal rank
@@ Property / cites work @@
+Node-Deletion Problems on Bipartite Graphs
@@ Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank @@
+Normal rank