X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
algorithms (4) 4
computer science (3) 3
algorithm analysis and problem complexity (2) 2
computer science, theory & methods (2) 2
acyclic s-t path (1) 1
approximation algorithms (1) 1
complexity (1) 1
computer communication networks (1) 1
computer graphics (1) 1
computer science, software engineering (1) 1
computer systems organization and communication networks (1) 1
data structures, cryptology and information theory (1) 1
discrete mathematics in computer science (1) 1
graph (1) 1
graph cuts (1) 1
graph-modeled network (1) 1
interval data (1) 1
iteratively reweighted least squares (1) 1
laplacian systems (1) 1
linearsystem (1) 1
lp rounding (1) 1
mathematics of computing (1) 1
mathematics, applied (1) 1
maximum flow problem (1) 1
methode der kleinsten quadrate (1) 1
min cut (1) 1
min-max (1) 1
min-max regret (1) 1
minimal s-t cut-set (1) 1
minimization (1) 1
network (1) 1
nodes (1) 1
numeric computing (1) 1
parallel linear system solvers (1) 1
paralleler algorithmus (1) 1
paths (1) 1
primal-dual method (1) 1
prize-collecting problems (1) 1
s , t -path tsp (1) 1
s - t min cut (1) 1
s, t-path tsp (1) 1
s,t-path tsp (1) 1
s-t cut-sets generation (1) 1
s-t min cut (1) 1
s-t min-cut (1) 1
spanning tree problem (1) 1
s–t min-cut (1) 1
t -joins (1) 1
t-joins (1) 1
theory of computation (1) 1
traveling salesman problem (1) 1
trees (1) 1
undirected graphs (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Parallel Computing, ISSN 0167-8191, 11/2016, Volume 59, pp. 43 - 59
•We formulate and derive a Parallel Iteratively Reweighted least squares Min-Cut solver (PIRMCut).•We propose a novel two-level rounding procedure and prove a... 
Undirected graphs | s–t min-cut | Laplacian systems | Parallel linear system solvers | Iteratively reweighted least squares | s-t min-cut | MINIMIZATION | MAXIMUM FLOW PROBLEM | COMPUTER SCIENCE, THEORY & METHODS | GRAPH CUTS | Algorithms | Computer science
Journal Article
2005, Lecture Notes in Computer Science, ISBN 9783540309352, Volume 3827, 10
Book Chapter
AIP Conference Proceedings, ISSN 0094-243X, 06/2016, Volume 1738, Issue 1
A new algorithm finding all minimal s-t cut-sets in a graph-modeled network with failing links and nodes is presented. It is based on the analysis of the tree... 
acyclic s-t path | s-t cut-sets generation | minimal s-t cut-set | Graph-modeled network | Nodes | Algorithms
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.