Suchergebnisse - Graph minimum-cut algorithm

GCphase: an SNP phasing method using a graph partition and error correction algorithm von Luo, Junwei, Wang, Jiayi, Zhai, Haixia, Wang, Junfeng

“… Results In this study, we present a graph-based algorithm, GCphase, which utilizes the minimum cut algorithm to perform phasing …”
Volltext

A new-old algorithm for minimum-cut and maximum-flow in closure graphs von Hochbaum, Dorit S.

“… We present an algorithm for solving the minimum‐cut problem on closure graphs without maintaining flow values …”
Volltext

Query Algorithms for Graph Connectivity and St-Minimum Cut von Auza, Arinta Primandini

“… This thesis focuses on two graph problems: connectivity and s-t-minimum cut. We study query algorithms to solve these problems …”
Volltext

I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs von Bhushan, Alka, Sajith, G.

“… The problem of finding the minimum cut of an undirected unweighted graph is studied on the external memory model …”
Volltext

An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision von Boykov, Y., Kolmogorov, V.

“… Minimum cut/maximum flow algorithms on graphs have emerged as an increasingly useful tool for exactor approximate energy minimization in low-level vision …”
Volltext

Minimum Cuts in Directed Graphs via Partial Sparsification von Cen, Ruoxu, Li, Jason, Nanongkai, Danupon, Panigrahi, Debmalya, Saranurak, Thatchaphol, Quanrud, Kent

“… We give an algorithm to find a minimum cut in an edge-weighted directed graph with n vertices and m edges in \tilde{O}(n\cdot\max\{m^{2/3},\ n\}) time …”
Volltext

Dynamic Graph Clustering Using Minimum-Cut Trees von Görke, Robert, Hartmann, Tanja, Wagner, Dorothea

Volltext

Minimum Cut in O(mlog2n) Time von Gawrychowski, Paweł, Mozes, Shay, Weimann, Oren

“… We give a randomized algorithm that finds a minimum cut in an undirected weighted m -edge n -vertex graph G with high probability in O ( m log 2 n ) time …”
Volltext

Fast approximate energy minimization via graph cuts von Boykov, Y., Veksler, O., Zabih, R.

“… Therefore, our focus is on efficient approximation algorithms. We present two algorithms based on graph cuts that efficiently find a local minimum with respect to two types of large moves, namely expansion moves and swap moves …”
Volltext

Analysis and network representation of hotspots in protein interfaces using minimum cut trees von Tuncbag, Nurcan, Salman, F. Sibel, Keskin, Ozlem, Gursoy, Attila

“… ‐based algorithms using a minimum cut tree (mincut tree). Edges in the network are weighted according to an energy function derived from knowledge‐based potentials …”
Volltext

Inverse Optimization von Ahuja, Ravindra K, Orlin, James B

“… In this paper, we study inverse optimization problems defined as follows. Let S denote the set of feasible solutions of an optimization problem P , let c be a …”
Volltext

Phylogenetic tree reconstruction via graph cut presented using a quantum-inspired computer von Onodera, Wataru, Hara, Nobuyuki, Aoki, Shiho, Asahi, Toru, Sawamura, Naoya

“… •The algorithm was named “Normalized-Minimum cut by Digital Annealer (NMcutDA)”•NMcutDA reconstructed better phylogenetic trees than those using other methods …”
Volltext

A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs von Apers, Simon, Auza, Arinta, Lee, Troy

“… An \(s{\operatorname{-}}t\) minimum cut in a graph corresponds to a minimum weight subset of edges whose removal disconnects vertices \(s\) and \(t …”
Volltext

The energy complexity of diameter and minimum cut computation in bounded-genus networks von Chang, Yi-Jun

Volltext

High‐Speed Minimum Cut Approximation in Dense Graph Using Compacted Pruned Tree von Ma, Ronghua, Yao, Weibin

“… ABSTRACT Solutions for minimum cut of a graph have been widely used in many applications, but existing acceleration methods have almost reached their limits by optimizing algorithm logic or reducing graph data …”
Volltext

Efficient Algorithms for the Inverse Spanning-Tree Problem von Hochbaum, Dorit S

“… The inverse spanning-tree problem is to modify edge weights in a graph so that a given tree T is a minimum spanning tree …”
Volltext

A Linear Time Algorithm for a Variant of the MAX CUT Problem in Series Parallel Graphs von Chaourar, Brahim

“… We deduce a linear time algorithm for the minimum cut problem in the same class of graphs without computing the maximum flow …”
Volltext

Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree von Saha, B., Mitra, P.

“… The algorithm is motivated by the minimum-cut tree based partitioning algorithm presented in G …”
Volltext

Graph-based review spammer group detection von Wang, Zhuo, Gu, Songmin, Zhao, Xiangnan, Xu, Xiaowei

“… In this paper, we introduce a top-down computing framework, namely GGSpam , to detect review spammer groups by exploiting the topological structure of the underlying reviewer graph which reveals …”
Volltext

Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree von Saha, Barna, Mitra, Pabitra

“… The algorithm maintains clusters of high quality in presence of insertion and deletion (update) of edges. The algorithm is motivated by the minimum-cut tree based partitioning algorithm …”
Volltext