Pages that link to "Item:Q1028116"

The following pages link to Enumeration aspects of maximal cliques and bicliques (Q1028116):

Displaying 12 items.

• On the termination of some biclique operators on multipartite graphs (Q496448) (← links)
• Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
• Representation of lattices via set-colored posets (Q1800386) (← links)
• Efficient enumeration of maximal induced bicliques (Q1983137) (← links)
• Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs (Q1987232) (← links)
• Enumerating all maximal biclusters in numerical datasets (Q2292925) (← links)
• Finding and enumerating large intersections (Q2344773) (← links)
• Handling least privilege problem and role mining in RBAC (Q2352353) (← links)
• Enumerating maximal bicliques in bipartite graphs with favorable degree sequences (Q2446577) (← links)
• On the computation of fixed points in Boolean networks (Q2511059) (← links)
• Scale reduction techniques for computing maximum induced bicliques (Q2633172) (← links)
• Enumeration of Minimal Dominating Sets and Variants (Q3088292) (← links)