Pages that link to "Item:Q5266538"
From MaRDI portal
The following pages link to Listing All Maximal Cliques in Large Sparse Real-World Graphs (Q5266538):
Displayed 43 items.
- Computing maximal cliques in link streams (Q897884) (← links)
- Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581) (← links)
- Local community detection based on small cliques (Q1657050) (← links)
- Enumerating maximal cliques in link streams with durations (Q1705705) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- A new decomposition technique for maximal clique enumeration for sparse graphs (Q1740688) (← links)
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication (Q1799209) (← links)
- Maximal strongly connected cliques in directed graphs: algorithms and bounds (Q1983136) (← links)
- Efficient enumeration of dominating sets for sparse graphs (Q1983139) (← links)
- Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph (Q1985603) (← links)
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs (Q1987232) (← links)
- Faster algorithms for counting subgraphs in sparse graphs (Q2041986) (← links)
- Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043) (← links)
- Compact structure for sparse undirected graphs based on a clique graph partition (Q2054100) (← links)
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2062119) (← links)
- 1-planarity testing and embedding: an experimental study (Q2088879) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes (Q2140500) (← links)
- SIAS-miner: mining subjectively interesting attributed subgraphs (Q2218410) (← links)
- Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2232246) (← links)
- Fast circular arc segmentation based on approximate circularity and cuboid graph (Q2251258) (← links)
- Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs (Q2633284) (← links)
- A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation (Q2673554) (← links)
- Improved Space Efficient Algorithms for BFS, DFS and Applications (Q2817855) (← links)
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (Q2980894) (← links)
- A Constructive Arboricity Approximation Scheme (Q3297754) (← links)
- Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472) (← links)
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties (Q4631095) (← links)
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection (Q4985798) (← links)
- Proximity Search for Maximal Subgraph Enumeration (Q5048293) (← links)
- (Q5090998) (← links)
- (Q5111887) (← links)
- Finding Cliques in Social Networks: A New Distribution-Free Model (Q5112249) (← links)
- On Approximating the Number of $k$-Cliques in Sublinear Time (Q5115700) (← links)
- Constraint and Satisfiability Reasoning for Graph Coloring (Q5129999) (← links)
- (Q5136240) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
- Listing Maximal Independent Sets with Minimal Space and Bounded Delay (Q5150928) (← links)
- (Q6065417) (← links)
- Essentially tight kernels for (weakly) closed graphs (Q6103524) (← links)
- Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)
