Results 1  10
of
92,696
Connected Subgraph Detection
"... We characterize the family of connected subgraphs in terms of linear matrix inequalities (LMI) with additional integrality constraints. We then show that convex relaxations of the integral LMI lead to parameterization of all weighted connected subgraphs. These developments allow for optimizing ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We characterize the family of connected subgraphs in terms of linear matrix inequalities (LMI) with additional integrality constraints. We then show that convex relaxations of the integral LMI lead to parameterization of all weighted connected subgraphs. These developments allow
Connection subgraphs in social networks
 In Workshop on Link Analysis, Counterterrorism, and Privacy, SIAM International Conference on Data Mining
, 2004
"... A connection subgraph is a small (ie, viewable) subgraph of a social network that best captures the relationship between two people. We present a formal definition of this problem, and an ideal solution based on computation of current in electrical networks, or equivalently, based on random walks on ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
A connection subgraph is a small (ie, viewable) subgraph of a social network that best captures the relationship between two people. We present a formal definition of this problem, and an ideal solution based on computation of current in electrical networks, or equivalently, based on random walks
Finding Highly Connected Subgraphs
"... Abstract. A popular way of formalizing clusters in networks are highly connected subgraphs, that is, subgraphs of k vertices that have edge connectivity larger than k/2 (equivalently, minimum degree larger than k/2). We examine the computational complexity of finding highly connected subgraphs. We ..."
Abstract
 Add to MetaCart
Abstract. A popular way of formalizing clusters in networks are highly connected subgraphs, that is, subgraphs of k vertices that have edge connectivity larger than k/2 (equivalently, minimum degree larger than k/2). We examine the computational complexity of finding highly connected subgraphs. We
On twoconnected subgraph polytopes
 Discrete Mathematics
, 1995
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
The Maximum Weight Connected Subgraph Problem
, 2013
"... The Maximum (Node) Weight Connected Subgraph Problem (MWCS) searches for a connected subgraph with maximum total weight in a nodeweighted (di)graph. In this work we introduce a new integer linear programming formulation built on node variables only, which uses new constraints based on nodeseparat ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The Maximum (Node) Weight Connected Subgraph Problem (MWCS) searches for a connected subgraph with maximum total weight in a nodeweighted (di)graph. In this work we introduce a new integer linear programming formulation built on node variables only, which uses new constraints based on node
ABSTRACT Fast Discovery of Connection Subgraphs
"... We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a paradigm for exploration and knowledge discovery in large social networks graphs. We present a formal definition of this pr ..."
Abstract
 Add to MetaCart
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a paradigm for exploration and knowledge discovery in large social networks graphs. We present a formal definition
A New Bound for the Edge Connected Subgraph Problem
, 1998
"... ravicmuedu Abstract Given a complete undirected graph with nonnegative costs on the edges the Edge Connected Subgraph Problem consists in nding the minimum cost spanning edge connected subgraph where multi edges are allowed in the solution A lower bound for the minimum cost edge connected subgrap ..."
Abstract
 Add to MetaCart
ravicmuedu Abstract Given a complete undirected graph with nonnegative costs on the edges the Edge Connected Subgraph Problem consists in nding the minimum cost spanning edge connected subgraph where multi edges are allowed in the solution A lower bound for the minimum cost edge connected
On the complexity of partitioning graphs into connected subgraphs
 Discrete Applied Mathematics
, 1985
"... This paper is mainly concerned with the computational complexity of determining whether or not the vertices of a graph can be partitioned into equal sized subsets so that each subset induces a particular type of graph. Many of the NPcompleteness results are for planar graphs. These are proved using ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
This paper is mainly concerned with the computational complexity of determining whether or not the vertices of a graph can be partitioned into equal sized subsets so that each subset induces a particular type of graph. Many of the NPcompleteness results are for planar graphs. These are proved using a planar version of 3dimensional matching. 1.
On Finding Minimal TwoConnected Subgraphs
 JOURNAL OF ALGORITHMS
, 1991
"... We present efficient parallel algorithms for the problems of finding a minimal2edgeconnected spanning subgraph of a 2edgeconnected graph and finding a minimal biconnected spanning subgraph of a biconnected graph. The parallel algorithms run in polylog time using a linear number of PRAM proces ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We present efficient parallel algorithms for the problems of finding a minimal2edgeconnected spanning subgraph of a 2edgeconnected graph and finding a minimal biconnected spanning subgraph of a biconnected graph. The parallel algorithms run in polylog time using a linear number of PRAM
Potential Anomalies Missing Connected Subgraph
"... • Search engines crawl the Web on a regular basis to create web graphs (∼100B vertices,∼1T edges). •Anomalies: Factors that may result in web graphs with poor Web represenation. •Anomalies can have a significant impact on the search results, e.g., they can affect ranking. •Anomaly detection is diff ..."
Abstract
 Add to MetaCart
• Search engines crawl the Web on a regular basis to create web graphs (∼100B vertices,∼1T edges). •Anomalies: Factors that may result in web graphs with poor Web represenation. •Anomalies can have a significant impact on the search results, e.g., they can affect ranking. •Anomaly detection is difficult because of the lack of a “perfect ” web graph to compare with and the large size of web graphs. Our Approach •We suggest detecting anomalies by measuring the amount and the significance of changes in consecutive web graphs. •We suggest 5 similarity metrics to quantify the differences between two web graphs. •We present an extensive experimental evaluation of our approach and the different similarity metrics.
Results 1  10
of
92,696