Pages that link to "Item:Q955035"
From MaRDI portal
The following pages link to A note on the problem of reporting maximal cliques (Q955035):
Displayed 12 items.
- The minimal \(k\)-core problem for modeling \(k\)-assemblies (Q282678) (← links)
- A graph coloring approach to the deployment scheduling and unit assignment problem (Q283268) (← links)
- Border bases for lattice ideals (Q321275) (← links)
- Computing Gröbner bases of pure binomial ideals via submodules of \(\mathbb Z^n\) (Q432760) (← links)
- Computing maximal cliques in link streams (Q897884) (← links)
- Refined pivot selection for maximal clique enumeration in graphs (Q899307) (← links)
- Isolation concepts for clique enumeration: comparison and computational experiments (Q1040581) (← links)
- Fast circular arc segmentation based on approximate circularity and cuboid graph (Q2251258) (← links)
- An extended depth-first search algorithm for optimal triangulation of Bayesian networks (Q2374531) (← links)
- All roads lead to Rome -- new search methods for the optimal triangulation problem (Q2375332) (← links)
- A linear time algorithm for maximal clique enumeration in large sparse graphs (Q2628285) (← links)
- Unfolding the Core Structure of the Reciprocal Graph of a Massive Online Social Network (Q2958366) (← links)