Wei Ding
City:
Hangzhou
State/Province:
Zhejiang
Country:
China
Current Affiliation:
Zhejiang Water Conservancy and Hydropower College
Current Position:
Lecturer
Field of Research:
MATHEMATICAL SCIENCES - Applied Mathematics - Operations Research
Research Interests:
Combinatorial Optimization, design and analysis of algorithm, mathematical modeling; current interests in QoS multicast routing, reliability of communication and failure tolerance, computational biology.
Publication History:
Selected:
[1] Wei Ding, Guoliang Xue. A Linear Time Algorithm for Computing a Most Reliable Source on a Tree network with Faulty Nodes. Theor. Comput. Sci. (TCS), vol. 412 (3), pp. 225-232, 2011.
[2] Wei Ding, Extended Hamilton Circuit and Its Application. ICIC’ 2010, vol. III, pp. 62-65, 2010.
[3] Wei Ding and Yi Shi, Preplanned Recovery Schemes Using Multiple Redundant Trees in Complete Graphs, FCC’2010, vol. 2, pp. 415-418, 2010.
[4] Wei Ding, Guohui Lin and Guoliang Xue, Diameter-Constrained Steiner Trees, Discrete Mathematics, Algorithms and Applications (DMAA), pp. 491-502, 2011.
[5] Wei Ding and Guoliang Xue, A Divide-and-Conquer Algorithm for Finding a Most Reliable Source on a Ring-Embedded Tree Network with Unreliable Edges, Discrete Mathematics, Algorithms and Applications (DMAA), pp. 503-516, 2011.
[6] Wei Ding, Embedded-Rings-Based Survivable Networks, IIS' 2010, vol. 2, pp. 412-415, 2010.
[7] Wei Ding, Many-to-Many Multicast Routing Under a Fixed Topology: Basic Architecture, Problems and Algorithms, ICNDC’ 2010, pp. 128-132, 2010.
[8] Wei Ding and Guoliang Xue. A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges. COCOA’ 2011, in: LNCS 6831, pp. 98-112, 2011.
[1] Wei Ding, Guoliang Xue. A Linear Time Algorithm for Computing a Most Reliable Source on a Tree network with Faulty Nodes. Theor. Comput. Sci. (TCS), vol. 412 (3), pp. 225-232, 2011.
[2] Wei Ding, Extended Hamilton Circuit and Its Application. ICIC’ 2010, vol. III, pp. 62-65, 2010.
[3] Wei Ding and Yi Shi, Preplanned Recovery Schemes Using Multiple Redundant Trees in Complete Graphs, FCC’2010, vol. 2, pp. 415-418, 2010.
[4] Wei Ding, Guohui Lin and Guoliang Xue, Diameter-Constrained Steiner Trees, Discrete Mathematics, Algorithms and Applications (DMAA), pp. 491-502, 2011.
[5] Wei Ding and Guoliang Xue, A Divide-and-Conquer Algorithm for Finding a Most Reliable Source on a Ring-Embedded Tree Network with Unreliable Edges, Discrete Mathematics, Algorithms and Applications (DMAA), pp. 503-516, 2011.
[6] Wei Ding, Embedded-Rings-Based Survivable Networks, IIS' 2010, vol. 2, pp. 412-415, 2010.
[7] Wei Ding, Many-to-Many Multicast Routing Under a Fixed Topology: Basic Architecture, Problems and Algorithms, ICNDC’ 2010, pp. 128-132, 2010.
[8] Wei Ding and Guoliang Xue. A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges. COCOA’ 2011, in: LNCS 6831, pp. 98-112, 2011.
-
Anianet provides custom content, colleague, and group recommendations as part of its free membership. Register or log in to access your own tailored recommendations.
-
Anianet provides the latest news, research, grant opportunities, and meeting announcements tailored to your interests as part of its free membership. Register or log in to access your own custom research news.
