Author:
Amaldi Edoardo,Liberti Leo,Maffioli Francesco,Maculan Nelson
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Mathematics,Software
Reference37 articles.
1. Alon N, Karp R, Peleg D, West D (1995) A graph-theoretic game and its application to the k-server problem. SIAM J Comput 24: 78–100
2. Amaldi E, Liberti L, Maculan N, Maffioli F (2004) Efficient edge-swapping heuristics for finding minimum fundamental cycle bases. In: Ribeiro C, Martins S (eds) Experimental and efficient algorithms—WEA2004 proceedings, Lecture Notes in Computer Science, vol 3059. Springer, Heidelberg, pp 15–29
3. Brambilla A, Premoli A (2001) Rigorous event-driven (red) analysis of large-scale nonlinear rc circuits. IEEE Trans Circuits Syst I Fundam Theory Appl 48(8): 938–946
4. Deo N, Prabhu G, Krishnamoorthy M (1982) Algorithms for generating fundamental cycles in a graph. ACM Trans Math Softw 8(1): 26–42
5. Deo N, Kumar N, Parsons J (1995) Minimum-length fundamental-cycle set problem: new heuristics and an empirical investigation. Congressus Numerantium 107: 141–154
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献