Results 1  10
of
489
Complexity and Applications of EdgeInduced VertexCuts
, 2006
"... Motivated by hypergraph decomposition algorithms, we introduce the notion of edgeinduced vertexcuts and compare it with the wellknown notions of edgecuts and vertexcuts. We investigate the complexity of computing minimum edgeinduced vertexcuts and demonstrate the usefulness of our notion by ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Motivated by hypergraph decomposition algorithms, we introduce the notion of edgeinduced vertexcuts and compare it with the wellknown notions of edgecuts and vertexcuts. We investigate the complexity of computing minimum edgeinduced vertexcuts and demonstrate the usefulness of our notion
Constant factor approximation of vertexcuts in planar graphs
 in Proceedings of the thirtyfifth annual ACM symposium on Theory of computing, ACM
, 2003
"... ABSTRACT We devise the first constant factor approximation algorithm for minimum quotient vertexcuts in planar graphs. Our algorithm achieves approximation ratio 1+ W . We use our algorithm for quotient vertexcuts to achieve the first constantfactor pseudoapproximation for vertex separators in ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
ABSTRACT We devise the first constant factor approximation algorithm for minimum quotient vertexcuts in planar graphs. Our algorithm achieves approximation ratio 1+ W . We use our algorithm for quotient vertexcuts to achieve the first constantfactor pseudoapproximation for vertex separators
A Data Structure for Dynamic Trees
, 1983
"... A data structure is proposed to maintain a collection of vertexdisjoint trees under a sequence of two kinds of operations: a link operation that combines two trees into one by adding an edge, and a cut operation that divides one tree into two by deleting an edge. Each operation requires O(log n) ti ..."
Abstract

Cited by 347 (21 self)
 Add to MetaCart
A data structure is proposed to maintain a collection of vertexdisjoint trees under a sequence of two kinds of operations: a link operation that combines two trees into one by adding an edge, and a cut operation that divides one tree into two by deleting an edge. Each operation requires O(log n
Minimum Vertex Cut Problem and Its Applications
"... © 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other w ..."
Abstract
 Add to MetaCart
© 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. A Genetic Algorithm for the MultiSource and MultiSink
Minimum cuts in nearlinear time
 Proc. of the 28th STOC
, 1996
"... Abstract. We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree packings combined with our previously developed random sampling techniques. We give a randomized (Monte Carl ..."
Abstract

Cited by 95 (12 self)
 Add to MetaCart
Carlo) algorithm that finds a minimum cut in an medge, nvertex graph with high probability in O(m log 3 n) time. We also give a simpler randomized algorithm that finds all minimum cuts with high probability in O(n 2 log n) time. This variant has an optimal ᏺᏯ parallelization. Both variants improve
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
position in kspace can be sampled at a time, making kspace speed the crucial determinant of scan time. Accordingly, gradient performance has been greatly enhanced in the past, reducing minimum scan time drastically with respect to earlier stages of the technique. However, due to both physiological
Edgedisjoint induced subgraphs with given minimum degree
"... Let h be a given positive integer. For a graph with n vertices and m edges, what is the maximum number of pairwise edgedisjoint induced subgraphs, each having minimum degree at least h? There are examples for which this number is O(m 2 /n 2). We prove that this bound is achievable for all graphs wi ..."
Abstract
 Add to MetaCart
Let h be a given positive integer. For a graph with n vertices and m edges, what is the maximum number of pairwise edgedisjoint induced subgraphs, each having minimum degree at least h? There are examples for which this number is O(m 2 /n 2). We prove that this bound is achievable for all graphs
Shortest Cut Graph of a Surface with Prescribed Vertex Set
, 2010
"... We describe a simple greedy algorithm whose input is a set P of vertices on a combinatorial surface S without boundary and that computes a shortest cut graph of S with vertex set P. (A cut graph is an embedded graph whose removal leaves a single topological disk.) If S has genus g and complexity n, ..."
Abstract
 Add to MetaCart
We describe a simple greedy algorithm whose input is a set P of vertices on a combinatorial surface S without boundary and that computes a shortest cut graph of S with vertex set P. (A cut graph is an embedded graph whose removal leaves a single topological disk.) If S has genus g and complexity n
A BranchandCutandPrice Algorithm for VertexBiconnectivity Augmentation
, 2009
"... In this paper, the rst approach for solving the vertexbiconnectivity augmentation problem (V2AUG) to optimality is proposed. Given a spanning subgraph of an edgeweighted graph, we search for the cheapest subset of edges to augment it in order to make it vertexbiconnected. The problem is reduced ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
is reduced to the augmentation of the corresponding blockcut tree [16] whose connectivity properties are exploited to develop two minimumcutbased ILP formulations: a directed and an undirected one. In contrast to the recently obtained result for the more general vertexbiconnected Steiner network problem
Node and edgedeletion NPcomplete problems
 CONFERENCE RECORD OF THE TENTH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING (SAN DIEGO, CALIF., 1978), ACM
, 1978
"... If ~ is a graph property, the general node(edge) deletion problem can be stated as follows: Find the minimum number of nodes(edges), whose deletion results in a subgraph satisfying property ~. In this paper we show that if ~ belongs to a rather broad class of properties (the class of properties that ..."
Abstract

Cited by 95 (0 self)
 Add to MetaCart
If ~ is a graph property, the general node(edge) deletion problem can be stated as follows: Find the minimum number of nodes(edges), whose deletion results in a subgraph satisfying property ~. In this paper we show that if ~ belongs to a rather broad class of properties (the class of properties
Results 1  10
of
489