Max-flow problem in undirected planar networks with node capacities being in NC
Journal of Computer Science and Technology
An efficient algorithm for XML type projection
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Mobility Limited Flip-Based Sensor Networks Deployment
IEEE Transactions on Parallel and Distributed Systems
An O(n log n) algorithm for maximum st-flow in a directed planar graph
Journal of the ACM (JACM)
Two-Level Push-Relabel Algorithm for the Maximum Flow Problem
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Detection of corrupted schema mappings in XML data integration systems
ACM Transactions on Internet Technology (TOIT)
Clustering with partial information
Theoretical Computer Science
Flow faster: efficient decision algorithms for probabilistic simulations
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Research of undirected network capacity expansion based on the spanning-tree
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Dinitz' algorithm: the original version and even's version
Theoretical Computer Science
A new approach to computing maximum flows using electrical flows
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |