Keyword: graph partitioning

Found 10 papers in total
Algorithms for Partition of Some Class of Graphs under Compaction and Vertex-Compaction
Algorithms for Partition of Some Class of Graphs under Compaction and Vertex-Compaction
2013,
The compaction problem is to partition the vertices of an input graph G onto the...
Weak Recovery Conditions from Graph Partitioning Bounds and Order Statistics
Weak Recovery Conditions from Graph Partitioning Bounds and Order Statistics
2013,
We study a weaker formulation of the nullspace property which guarantees recovery of...
Convex partitions with 2‐edge connected dual graphs
Convex partitions with 2‐edge connected dual graphs
2011,
It is shown that for every finite set of disjoint convex polygonal obstacles in the...
A characterization of graphs with disjoint dominating and paired‐dominating sets
A characterization of graphs with disjoint dominating and paired‐dominating sets
2011,
A dominating set of a graph is a set of vertices such that every vertex not in the set...
A Note on Edge‐based Graph Partitioning and its Linear Algebraic Structure
A Note on Edge‐based Graph Partitioning and its Linear Algebraic Structure
2011,
We analyze two essential problems arising from edge‐based graph partitioning....
A branch‐and‐cut algorithm based on semidefinite programming for the minimum k‐partition problem
A branch‐and‐cut algorithm based on semidefinite programming for the minimum k‐partition problem
2011,
The minimum k ‐partition (M k P) problem is the problem of partitioning the set...
A Greedy Partition Lemma for directed domination
A Greedy Partition Lemma for directed domination
2011,
A directed dominating set in a directed graph D is a set S of vertices of V such that...
Minimum Weight Convex Steiner Partitions
Minimum Weight Convex Steiner Partitions
2011,
New tight bounds are presented on the minimum length of planar straight line graphs...
Spectral methods for graph clustering – A survey
Spectral methods for graph clustering – A survey
2011,
Graph clustering is an area in cluster analysis that looks for groups of related...
A projection technique for partitioning the nodes of a graph
A projection technique for partitioning the nodes of a graph
1995,
Let G=(N,E) be an undirected graph. The authors present several new techniques for...
Papers per page: