On computing the Galois lattice of bipartite distance hereditary graphs (Q2357768): Difference between revisions

@@ Property / cites work @@
+Can visibility graphs be represented compactly?
@@ Property / cites work: Can visibility graphs be represented compactly? / rank @@
+Normal rank
@@ Property / cites work @@
+A convexity upper bound for the number of maximal bicliques of a bipartite graph
+Normal rank
@@ 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 @@
+On the Galois lattice of bipartite distance hereditary graphs
+Normal rank
@@ Property / cites work @@
+Distance-hereditary graphs
@@ Property / cites work: Distance-hereditary graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A local approach to concept generation
@@ Property / cites work: A local approach to concept generation / rank @@
+Normal rank
@@ Property / cites work @@
+Formal Concept Analysis
@@ Property / cites work: Formal Concept Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Dismantlable Lattices in the Mirror
@@ Property / cites work: Dismantlable Lattices in the Mirror / rank @@
+Normal rank
@@ Property / cites work @@
+An Almost Linear-Time Algorithm for Graph Realization
+Normal rank
@@ Property / cites work @@
+Chromatic characterization of biclique covers
@@ Property / cites work: Chromatic characterization of biclique covers / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Recognition Algorithm for Cographs
@@ Property / cites work: A Linear Recognition Algorithm for Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs
+Normal rank
@@ Property / cites work @@
+Arboricity and bipartite subgraph listing algorithms
+Normal rank
@@ Property / cites work @@
+Q4230685
@@ Property / cites work: Q4230685 / rank @@
+Normal rank
@@ Property / cites work @@
+Completely separable graphs
@@ Property / cites work: Completely separable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and algorithms.
+Normal rank
@@ Property / cites work @@
+On computing the size of a lattice and related decision problems
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / 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 @@
+The arborescence-realization problem
@@ Property / cites work: The arborescence-realization problem / rank @@
+Normal rank