Pages that link to "Item:Q2442801"
From MaRDI portal
The following pages link to Fast algorithms for determining (generalized) core groups in social networks (Q2442801):
Displayed 32 items.
- Incremental problems in the parameterized complexity setting (Q519883) (← links)
- A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- Efficient and effective community search (Q1715901) (← links)
- The maximum clique interdiction problem (Q1735171) (← links)
- An efficient exact algorithm for triangle listing in large graphs (Q1741284) (← links)
- Identifying and ranking influential spreaders in complex networks by neighborhood coreness (Q1782576) (← links)
- Experiments on \(F\)-restricted bi-pattern mining (Q2086640) (← links)
- An order approach for the core maintenance problem on edge-weighted graphs (Q2151388) (← links)
- Discovering subjectively interesting multigraph patterns (Q2203340) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
- Percolation on complex networks: theory and application (Q2231806) (← links)
- Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
- Degree sequences of monocore graphs (Q2509547) (← links)
- Random networks are heterogeneous exhibiting a multi-scaling law (Q2668264) (← links)
- Restricted bi-pattern mining (Q2670900) (← links)
- Core Decomposition, Maintenance and Applications (Q3297830) (← links)
- Metanetworks of artificially evolved regulatory networks (Q3302629) (← links)
- Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472) (← links)
- The k-Dense Method to Extract Communities from Complex Networks (Q3627917) (← links)
- Practical Minimum Cut Algorithms (Q4629534) (← links)
- Distributed Core Decomposition in Probabilistic Graphs (Q5024479) (← links)
- Graph Kernels: A Survey (Q5026222) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- Bounds and algorithms for graph trusses (Q5119376) (← links)
- A<i>k</i>-shell decomposition method for weighted networks (Q5137692) (← links)
- Density decompositions of networks (Q5233139) (← links)
- Network analysis of Zentralblatt MATH data (Q5496564) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
- A family of pairwise multi-marginal optimal transports that define a generalized metric (Q6097155) (← links)
- Efficient algorithms for finding diversified top-\(k\) structural hole spanners in social networks (Q6191151) (← links)
- OCSM: finding overlapping cohesive subgraphs with minimum degree (Q6195198) (← links)