Pages that link to "Item:Q848935"
From MaRDI portal
The following pages link to An efficient algorithm for solving pseudo clique enumeration problem (Q848935):
Displaying 12 items.
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
- Subjective interestingness of subgraph patterns (Q338641) (← links)
- Micro-review synthesis for multi-entity summarization (Q1741329) (← links)
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs (Q1987232) (← links)
- Discovering subjectively interesting multigraph patterns (Q2203340) (← links)
- Generating fixed density bracelets of arbitrary base (Q2875290) (← links)
- On Fast Enumeration of Pseudo Bicliques (Q3000513) (← links)
- An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties (Q4631095) (← links)
- An Efficient Algorithm for Enumerating Pseudo Cliques (Q5387774) (← links)
- Polynomial-delay generation of functional digraphs up to isomorphism (Q6611003) (← links)