Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
A data structure for dynamic trees
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
An o(nm log n) algorithm for maximum network flow
An o(nm log n) algorithm for maximum network flow
Graphs and Hypergraphs
Efficient algorithms for finding maximum matching in graphs
ACM Computing Surveys (CSUR)
A Synthesis Algorithm for Reconfigurable Interconnection Networks
IEEE Transactions on Computers
Unique maximum matching algorithms
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Implementing weighted b-matching algorithms: towards a flexible software design
Journal of Experimental Algorithmics (JEA)
Implementing weighted b-matching algorithms: insights from a computational study
Journal of Experimental Algorithmics (JEA)
Implementing Weighted b-Matching Algorithms: Insights from a Computational Study
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Finding a δ-regular supergraph of minimum order
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
(p, k)-coloring problems in line graphs
Theoretical Computer Science
Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem
ACM Transactions on Algorithms (TALG)
Popular matchings in the capacitated house allocation problem
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Greedy in approximation algorithms
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
An improved approximation algorithm for maximum edge 2-coloring in simple graphs
Journal of Discrete Algorithms
The maximum edge-disjoint paths problem in complete graphs
Theoretical Computer Science
Graph summarization with bounded error
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Efficient algorithms for the 2-gathering problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximating the Metric TSP in Linear Time
Graph-Theoretic Concepts in Computer Science
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
Approximation and Online Algorithms
Approximation algorithm for maximum edge coloring
Theoretical Computer Science
Parameterized graph cleaning problems
Discrete Applied Mathematics
Approximating the maximum 2- and 3-edge-colorable subgraph problems
Discrete Applied Mathematics
Finding a Δ-regular supergraph of minimum order
Discrete Applied Mathematics
Efficient algorithms for the 2-gathering problem
ACM Transactions on Algorithms (TALG)
Popular matchings in the weighted capacitated house allocation problem
Journal of Discrete Algorithms
Approximation algorithms for maximum edge coloring problem
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Ab initio whole genome shotgun assembly with mated short reads
RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
Minimizing total busy time in parallel scheduling with application to optical networks
Theoretical Computer Science
Approximating maximum edge 2-coloring in simple graphs
Discrete Applied Mathematics
Approximating maximum edge 2-coloring in simple graphs
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
On approximating the d-girth of a graph
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Social content matching in MapReduce
Proceedings of the VLDB Endowment
Speed dating: an algorithmic case study involving matching and scheduling
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On the maximum locally clustered subgraph and some related problems
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
The hospitals/residents problem with quota lower bounds
ESA'11 Proceedings of the 19th European conference on Algorithms
B-Matching for spectral clustering
ECML'06 Proceedings of the 17th European conference on Machine Learning
A better-than-greedy algorithm for k-set multicover
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Restricted b-matchings in degree-bounded graphs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
On the approximability of some degree-constrained subgraph problems
Discrete Applied Mathematics
Minimum mean cycle problem in bidirected and skew-symmetric graphs
Discrete Optimization
Enabling mobile distributed social networking on smartphones
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Computability of models for sequence assembly
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
A model for minimizing active processor time
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Anonymizing Subsets of Social Networks with Degree Constrained Subgraphs
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
A refined complexity analysis of degree anonymization in graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
On approximating the d-girth of a graph
Discrete Applied Mathematics
Maximum matching in multi-interface networks
Theoretical Computer Science
Asymptotically optimal algorithms for geometric Max TSP and Max m-PSP
Discrete Applied Mathematics
| Hi-index | 0.01 |
Efficient algorithms are given for the bidirected network flow problem and the degree-constrained subgraph problem. Four versions of each are solved, depending on whether edge capacities/multiplicities are one or arbitrary, and whether maximum value/maximum cardinality or minimum cost/maximum weight is the objective. A version of the shortest path problem is also efficiently solved. The algorithms use a reduction technique that solves one problem instance by reducing to a number of problems.