Author:
Bazgan Cristina,Toubaline Sonia,Vanderpooten Daniel
Subject
Management Science and Operations Research,Modeling and Simulation,General Computer Science
Reference23 articles.
1. Bar-Noy A, Khuller S, Schieber B. The complexity of finding most vital arcs and nodes. Technical Report CS-TR-3539, University of Maryland; 1995.
2. Bazgan C, Toubaline S, Vanderpooten D. Complexity of determining the most vital elements for the 1-median and 1-center location problems. In: Proceeding of the fourth annual international conference on combinatorial optimization and applications (COCOA 2010), Lecture notes in computer science, vol. 6508, Part I; 2010. p. 237–51.
3. Bazgan C, Toubaline S, Vanderpooten D. Critical edges/nodes for the minimum spanning tree problem: complexity and approximation. Journal of Combinatorial Optimization, doi:10.1007/s10878-011-9449-4, to appear.
4. A minimum spanning tree algorithm with inverse-Ackermann type complexity;Chazelle;Journal of the ACM,2000
5. Verification and sensitivity analysis of minimum spanning trees in linear time;Dixon;SIAM Journal on Computing,1992
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献