Skip to search formSkip to main contentSkip to account menu

Dense subgraph

In computer science the notion of highly connected subgraphs appears frequently. This notion can be formalized as follows. Let be an undirected graph… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
AlgorithmicaAndrew V. GoldbergClique problemComputer science

Broader (1)

Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Chapter 1 Fraud Detection-Dense Subgraph Detection
Fraud behaviors can be spotted everywhere on online applications such as social networks where the behavior data can be… 
2017
2017
Core Discovery in Hidden Graphs
Massive network exploration is an important research direction with many applications. In such a setting, the network is, usually… 
2015
2015
Exploiting Semantics to Predict Potential Novel Links from Dense Subgraphs
Knowledge graphs encode semantic knowledge that can be exploited to enhance different data management tasks, e.g., query… 
2015
2015
Flickr circles: Mining socially-aware aesthetic tendency
Aesthetic tendency discovery is a useful and interesting application in social media. This paper proposes to categorize large… 
2014
2014
Mining Representative Cohesive Dense Subgraphs
Data mining techniques have an important implication in social and biological network analysis, were we’re interested in finding… 
2013
2013
Structual Change Point Detection for Evolutional Networks
We propose a change point detection algorithm for a sequence of graphs. Our algorithm focuses on the change of the structure of… 
2012
2012
Parallel graph algorithms for finding weighted matchings and subgraphs in computational science
Graphs constitute one of the most crucial data structures in computational science and engineering. The algorithms operating on… 
2007
2007
A Layered Interest Based Topology Organizing Model for Unstructured P2P
There are two pivotal problems in unstructured P2P system:Topology self-organization and query algorithms,however,the former is… 
2005
2005
Dense subgraph problem revisited
We note the condition 0 ≤ w(e) ≤ 1 is given since it is convenient for presenting our theoretical results, although we can define… 
2005
2005
Searching Similar Modules in Protein Interaction Netwo
We developed a new method to search protein networks functionally similar to a given query signal transduction pathway within… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)