Pages that link to "Item:Q1270816"
From MaRDI portal
The following pages link to Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs (Q1270816):
Displaying 8 items.
- Bicolored independent sets and bicliques (Q436317) (← links)
- An exact exponential time algorithm for counting bipartite cliques (Q436594) (← links)
- Generating bicliques of a graph in lexicographic order (Q557825) (← links)
- Edge cover by connected bipartite subgraphs (Q646717) (← links)
- Covering graphs with few complete bipartite subgraphs (Q1019181) (← links)
- Representing attribute reduction and concepts in concept lattice using graphs (Q1703689) (← links)
- Tight lower bounds on the number of bicliques in false-twin-free graphs (Q5890720) (← links)
- Tight lower bounds on the number of bicliques in false-twin-free graphs (Q5890936) (← links)
