Pages that link to "Item:Q557825"
From MaRDI portal
The following pages link to Generating bicliques of a graph in lexicographic order (Q557825):
Displaying 18 items.
- Bicolored independent sets and bicliques (Q436317) (← links)
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809) (← links)
- Almost every graph is divergent under the biclique operator (Q908300) (← links)
- Enumeration aspects of maximal cliques and bicliques (Q1028116) (← links)
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- Exact exponential-time algorithms for finding bicliques (Q1944039) (← links)
- Efficient enumeration of maximal induced bicliques (Q1983137) (← links)
- On independent sets and bicliques in graphs (Q2428684) (← links)
- Enumerating maximal bicliques in bipartite graphs with favorable degree sequences (Q2446577) (← links)
- On Maximal Chain Subgraphs and Covers of Bipartite Graphs (Q2819498) (← links)
- Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs, (Q2907957) (← links)
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202) (← links)
- (Q4691855) (← links)
- On the Iterated Biclique Operator (Q4920658) (← links)
- DECOMPOSITIONAL APPROACH TO RESEARCH OF FORMAL CONTEXTS (Q5151269) (← links)
- Biclique graphs and biclique matrices (Q5189236) (← links)
- On Independent Sets and Bicliques in Graphs (Q5302053) (← links)
- Tight lower bounds on the number of bicliques in false-twin-free graphs (Q5890720) (← links)
