Results 1  10
of
14
An Experimental Comparison of MinCut/MaxFlow Algorithms for Energy Minimization in Vision
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2001
"... After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in lowlevel vision. The combinatorial optimization literature provides many mincut/maxflow algorithms with different polynomial time compl ..."
Abstract

Cited by 794 (48 self)
 Add to MetaCart
After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in lowlevel vision. The combinatorial optimization literature provides many mincut/maxflow algorithms with different polynomial time complexity. Their practical efficiency, however, has to date been studied mainly outside the scope of computer vision. The goal of this paper
Practical Network Coding
, 2003
"... We propose a distributed scheme for practical network coding that obviates the need for centralized knowledge of the graph topology, the encoding functions, and the decoding functions, and furthermore obviates the need for information to be communicated synchronously through the network. The resu ..."
Abstract

Cited by 286 (13 self)
 Add to MetaCart
We propose a distributed scheme for practical network coding that obviates the need for centralized knowledge of the graph topology, the encoding functions, and the decoding functions, and furthermore obviates the need for information to be communicated synchronously through the network. The result is a practical system for network coding that is robust to random packet loss and delay as well as robust to any changes in the network topology or capacity due to joins, leaves, node or link failures, congestion, and so on. We simulate such a practical network coding system using the network topologies of several commercial Internet Service Providers, and demonstrate that it can achieve close to the theoretically optimal performance.
Efficient Identification of Web Communities
 In Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
, 2000
"... We de ne a community on the web as a set of sites that have more links (in either direction) to members of the community than to nonmembers. Members of such a community can be eciently identi ed in a maximum ow / minimum cut framework, where the source is composed of known members, and the sink c ..."
Abstract

Cited by 228 (12 self)
 Add to MetaCart
We de ne a community on the web as a set of sites that have more links (in either direction) to members of the community than to nonmembers. Members of such a community can be eciently identi ed in a maximum ow / minimum cut framework, where the source is composed of known members, and the sink consists of wellknown nonmembers. A focused crawler that crawls to a xed depth can approximate community membership by augmenting the graph induced by the crawl with links to a virtual sink node. The effectiveness of the approximation algorithm is demonstrated with several crawl results that identify hubs, authorities, web rings, and other link topologies that are useful but not easily categorized. Applications of our approach include focused crawlers and search engines, automatic population of portal categories, and improved ltering.
Reachability and Distance Queries via 2Hop Labels
, 2002
"... Reachability and distance queries in graphs are fundamental to numerous applications, ranging from geographic navigation systems to Internet routing. Some of these applications involve huge graphs and yet require fast query answering. We propose a new data structure for representing all distances in ..."
Abstract

Cited by 77 (0 self)
 Add to MetaCart
Reachability and distance queries in graphs are fundamental to numerous applications, ranging from geographic navigation systems to Internet routing. Some of these applications involve huge graphs and yet require fast query answering. We propose a new data structure for representing all distances in a graph. The data structure is distributed in the sense that it may be viewed as assigning labels to the vertices, such that a query involving vertices u and v may be answered using only the labels of u and v.
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
"... We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n x n matrix to within a multiplicative factor of e^n. To this end ..."
Abstract

Cited by 63 (8 self)
 Add to MetaCart
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n x n matrix to within a multiplicative factor of e^n. To this end
Implementing an Efficient Minimum Capacity Cut Algorithm
 MATHEMATICAL PROGRAMMING
, 1994
"... In this paper, we present an efficient implementation of the O(mn + n 2 log n) time algorithm originally proposed by Nagamochi and Ibaraki (1992) for computing the minimum capacity cut of an undirected network. To enhance computation, various ideas are added so that it can contract as many edges ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
In this paper, we present an efficient implementation of the O(mn + n 2 log n) time algorithm originally proposed by Nagamochi and Ibaraki (1992) for computing the minimum capacity cut of an undirected network. To enhance computation, various ideas are added so that it can contract as many edges as possible in each iteration. To evaluate the performance of the resulting implementation, we conducted extensive computational experiment, and compared the results with that of Padberg and Rinaldi's algorithm (1990), which is currently known as one of the practically fastest programs for this problem. The results indicate that our program is considerably faster than Padberg and Rinaldi's program, and its running time is not signicantly aected by the types of the networks being solved.
Deterministic O(nm) Time EdgeSplitting in Undirected Graphs
 J. Combinatorial Optimization
, 1997
"... This paper presents a deterministic O(nm log n + n 2 log 2 n) = ~ O(nm) time algorithm for splitting o all edges incident to a vertex s of even degree in a multigraph G, where n and m are the numbers of vertices and links (= vertex pairs between which G has an edge) in G, respectively. Based o ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
This paper presents a deterministic O(nm log n + n 2 log 2 n) = ~ O(nm) time algorithm for splitting o all edges incident to a vertex s of even degree in a multigraph G, where n and m are the numbers of vertices and links (= vertex pairs between which G has an edge) in G, respectively. Based on this, many graph algorithms using edgesplitting can run faster. For example, the edgeconnectivity augmentation problem in an undirected multigraph can be solved in ~ O(nm) time, which is an improvement over the previously known randomized ~ O(n 3 ) bound and deterministic ~ O(n 2 m) bound. 1 Introduction Let G = (V; E) stand for an undirected multigraph with a set V of vertices and a set E of edges, where an edge with end vertices u and v is denoted by (u; v). A singleton set fxg may be simply written as x, and \ " implies proper inclusion while \ " means \ " or \ = ". For two disjoint subsets X;Y V , we denote by EG (X; Y ) the set of edges, one of whose end vertices is i...
A Note on Minimizing Submodular Functions
 Information Processing Letters
, 1998
"... For a given submodular function f on a nite set V , we consider the problem of nding a nonempty and proper subset X of V that minimizes f(X). If the function f is symmetric, then the problem can be solved by a purely combinatorial algorithm due to Queyranne (1995). This note considers a slightly mor ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
For a given submodular function f on a nite set V , we consider the problem of nding a nonempty and proper subset X of V that minimizes f(X). If the function f is symmetric, then the problem can be solved by a purely combinatorial algorithm due to Queyranne (1995). This note considers a slightly more general condition than symmetry, i.e., f(X)+f (Y ) f(X Y )+f(Y X) for all X;Y V , and shows that a modication of Queyranne's algorithm solves the problem by using O(jV j 3 ) calls to function value oracle. In this case, all minimal optimal solutions can also be obtained by using O(jV j 3 ) calls to function value oracle. keywords: algorithms, combinatorial problems, computational complexity 1 Introduction Let V be a nite set, and f be a set function f : 2 V 7! !, where ! (! + ) is the set of reals (positive reals). A singleton set fvg may be written as v, and the union of a set X and a singleton fvg may be written as X + v. Furthermore, \ " denotes proper inclusion whil...
ResourceConstrained Project Scheduling With Branching Scheme Based On Dynamic Release Dates
, 1999
"... We propose a branchandbound algorithm for resourceconstrained project scheduling where any two of jobs can be linked by arbitrary minimal and maximal time lags. The jobs have to be scheduled nonpreemptively, and while in process, they require several limited resources. The objective is to find a ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
We propose a branchandbound algorithm for resourceconstrained project scheduling where any two of jobs can be linked by arbitrary minimal and maximal time lags. The jobs have to be scheduled nonpreemptively, and while in process, they require several limited resources. The objective is to find a feasible schedule which minimizes the project makespan. Different branchandbound algorithms have been previously proposed  either based on constraint propagation techniques, or based on the idea to branch over socalled resource conflicts which are resolved by introducing additional precedence constraints. Our approach also follows the latter principle. The new idea is to resolve resource conflicts only locally by a dynamic update of job release dates instead of introducing precedence constraints. This gives rise to a reduction of both computation time and memory requirements in every node of the enumeration tree, however, at the expense of a loss of information. Nevertheless, enriched ...
A Faster Algorithm for Computing Minimum 5Way and 6Way Cuts in Graphs
 In 5th Annual International Computing and Combinatorics Conference
, 1999
"... For an edgeweighted graph G with n vertices and m edges, the minimum kway cut problem is to find a partition of the vertex set into k nonempty subsets so that the weight sum of edges between different subsets is minimized. For this problem with k = 5 and 6, we present a deterministic algorithm th ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
For an edgeweighted graph G with n vertices and m edges, the minimum kway cut problem is to find a partition of the vertex set into k nonempty subsets so that the weight sum of edges between different subsets is minimized. For this problem with k = 5 and 6, we present a deterministic algorithm that runs in k02 (nF (n; m)+C 2 (n; m)+n )) = O(mn =m)) time, where F(n, m) and C_2(n, m) denote respectively the time bounds required to solve the maximum flow problem and the minimum 2way cut problem in G. The bounds ~ ) for k = 5 and ) for k = 6 improve the previous best randomized bounds ), respectively.