Finding Dense Subgraphs in Relational Graphs

No abstract is available for this paper.

• Publication year

  2015

• Venue

  ECML/PKDD

• Publication date

  2015-09-07

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-319-23525-7_39
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Supplemental Material for:Finding Dense Subgraphs via Low-Rank Bilinear Optimization

  2014cited by this paper
• {SNAP Datasets}: {Stanford} Large Network Dataset Collection

  2014cited by this paper
• Lovász ϑ function, SVMs and finding dense subgraphs

  2013cited by this paper
• Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees

  2013cited by this paper
• MiMAG: mining coherent subgraphs in multi-layer graphs with edge labels

  2012cited by this paper
• A survey of frequent subgraph mining algorithms

  2012cited by this paper
• The Lovász ϑ function, SVMs and finding large dense subgraphs

  2012cited by this paper
• Densest Subgraph in Streaming and MapReduce

  2012cited by this paper
• Truncated power method for sparse eigenvalue problems

  2011cited by this paper
• Integrative Analysis of Many Weighted Co-Expression Networks Using Tensor Computation

  2011influential reference
• Detecting High Log-Densities – an O ( n 1 / 4 ) Approximation for Densest k -Subgraph

  2010cited by this paper
• A Survey of Algorithms for Dense Subgraph Discovery

  2010cited by this paper
• Mining frequent cross-graph quasi-cliques

  2009cited by this paper
• On Finding Dense Subgraphs

  2009influential reference
• Finding Dense Subgraphs with Size Bounds

  2009cited by this paper
• Coherent closed quasi-clique discovery from large dense graph databases

  2006cited by this paper
• Mining coherent dense subgraphs across massive biological networks for functional discovery

  2005cited by this paper
• Mining closed relational graphs with connectivity constraints

  2005cited by this paper
• Graphs over time: densification laws, shrinking diameters and possible explanations

  2005cited by this paper
• Mining cross-graph quasi-cliques in gene expression and protein interaction data

  2005cited by this paper
• Multiple kernel learning, conic duality, and the SMO algorithm

  2004cited by this paper
• Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique

  2004cited by this paper
• Approximation Algorithms for Maximization Problems Arising in Graph Partitioning

  2001cited by this paper
• The Dense k -Subgraph Problem

  2001cited by this paper
• Greedy approximation algorithms for finding dense components in a graph

  2000influential reference
• Finding Dense Subgraphs with Semidefinite Programming

  1998cited by this paper
• Greedily Finding a Dense Subgraph

  1996cited by this paper
• Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993

  1996cited by this paper
• Cliques, Coloring, and Satisfiability

  1996cited by this paper
• Heuristic and Special Case Algorithms for Dispersion Problems

  1994cited by this paper
• A Fast Parametric Maximum Flow Algorithm and Applications

  1989cited by this paper
• Finding a Maximum Density Subgraph

  1984cited by this paper

• A powerful lens for temporal network analysis: temporal motifs

  2025cites this paper
• FocusCores of Multilayer Graphs

  2025cites this paper
• Fast Multilayer Core Decomposition and Indexing

  2024cites this paper
• FocusCore Decomposition of Multilayer Graphs

  2024cites this paper
• Q-DISCO: Query-Centric Densest Subgraphs in Networks with Opinion Information

  2024cites this paper
• Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs

  2024cites this paper
• In-depth Analysis of Densest Subgraph Discovery in a Unified Framework

  2024cites this paper
• A Unified Core Structure in Multiplex Networks: From Finding the Densest Subgraph to Modeling User Engagement

  2024influential citation
• Dense Subgraph Discovery Meets Strong Triadic Closure

  2024cites this paper
• Multilayer Correlation Clustering

  2024cites this paper
• Interrelated Dense Pattern Detection in Multilayer Networks

  2024cites this paper
• A Survey on the Densest Subgraph Problem and its Variants

  2023influential citation
• Generalized Densest Subgraph in Multiplex Networks

  2023influential citation
• Jaccard-constrained dense subgraph discovery

  2023cites this paper
• Scalable Algorithms for Densest Subgraph Discovery

  2023cites this paper
• A Survey of Densest Subgraph Discovery on Large Graphs

  2023influential citation
• Cohesive Subgraph Search Over Large Heterogeneous Information Networks

  2022cites this paper
• FirmCore Decomposition of Multilayer Networks

  2022cites this paper
• FirmTruss Community Search in Multilayer Networks

  2022cites this paper
• Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques

  2022cites this paper
• Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks

  2022influential citation
• Truss Decomposition on Multilayer Graphs

  2021cites this paper
• Maximum (L, K)-Lasting Cores in Temporal Social Networks

  2021cites this paper
• Dense and well-connected subgraph detection in dual networks

  2021cites this paper
• Graph signatures: Identification and optimization

  2021cites this paper
• Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions

  2021cites this paper
• Finding dense subgraphs with maximum weighted triangle density

  2020cites this paper
• Span-core Decomposition for Temporal Networks

  2019cites this paper
• Cores and Other Dense Structures in Complex Networks

  2019influential citation
• CoreCube: Core Decomposition in Multilayer Graphs

  2019cites this paper
• On Finding Dense Common Subgraphs

  2018influential citation
• Mining (maximal) Span-cores from Temporal Networks

  2018cites this paper
• Finding events in temporal networks: segmentation meets densest subgraph discovery

  2018influential citation
• Storage, processing and analysis of large evolving graphs

  2018influential citation
• Core Decomposition in Multilayer Networks

  2018influential citation
• Core Decomposition and Densest Subgraph in Multilayer Networks

  2017cites this paper
• Finding the Densest Common Subgraph with Linear Programming

  2016influential citation
• Machine Learning and Knowledge Discovery in Databases

  2016cites this paper
• Finding lasting dense subgraphs

  2016cites this paper
• Lecture Notes in Arti fi cial Intelligence

  2015cites this paper