|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 30 occurrences of 29 keywords
|
|
|
Results
Found 96 publication records. Showing 96 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
169 | Xue Zhang 0001, Jue Hong, Sanglu Lu, Li Xie 0001, Jiannong Cao 0001 |
Scoped Bellman-Ford Geographic Routing for Large Dynamic Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 23(6), pp. 944-956, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Bellman-Ford, void (hole), wireless sensor network, scalability, geographic routing |
105 | Hideki Tode, Zhu Tianwei, Shouhei Nishi, Koso Murakami |
A Route Design Algorithm for Multiple-Encoding Optical CDM Switching Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: Proceedings 27th Conference on Local Computer Networks, Tampa, Florida, USA, 8-10 November, 2000, pp. 565-572, 2000, IEEE Computer Society, 0-7695-0912-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
light interference, photonic switching systems, route design algorithm, multiple-encoding optical CDM switching network, photonic IP switching system, routing information, interference noise, restrict-complied routing method, Bellman-Ford algorithm, Internet, transport protocols, encoding, network topologies, telecommunication network routing, optical fibre networks, next generation Internet |
91 | Mohammad Baharloo, Reza Hajisheykhi, Mohammad Arjomand, Amir-Hossein Jahangir |
An Analytical Performance Evaluation for WSNs Using Loop-Free Bellman Ford Protocol. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AINA ![In: The IEEE 23rd International Conference on Advanced Information Networking and Applications, AINA 2009, Bradford, United Kingdom, May 26-29, 2009, pp. 568-571, 2009, IEEE Computer Society, 978-0-7695-3638-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Analytical mode, Loop-Free Bellman Ford Protocol, Wireless Sensor Network, Queuing system |
90 | C. Cheng, R. Riley, Srikanta P. R. Kumar, J. J. Garcia-Luna-Aceves |
A Loop-Free Extended Bellman-Ford Routing Protocol Without Bouncing Effect. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCOMM ![In: Proceedings of the ACM Symposium on Communications Architectures & Protocols, SIGCOMM 1989, Austin, TX, USA, September 19-22, 1989, pp. 224-236, 1989, ACM, 0-89791-332-9. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
78 | Daniel Sawitzki |
Experimental Studies of Symbolic Shortest-Path Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental and Efficient Algorithms, Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings, pp. 482-497, 2004, Springer, 3-540-22067-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
64 | Mongkol Ekpanyapong, Thaisiri Watewai, Sung Kyu Lim |
Statistical Bellman-Ford algorithm with an application to retiming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC ![In: Proceedings of the 2006 Conference on Asia South Pacific Design Automation: ASP-DAC 2006, Yokohama, Japan, January 24-27, 2006, pp. 959-964, 2006, IEEE, 0-7803-9451-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
64 | A. S. Nepomniaschaya |
An Associative Version of the Bellman-Ford Algorithm for Finding the Shortest Paths in Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PaCT ![In: Parallel Computing Technologies, 6th International Conference, PaCT 2001, Novosibirsk, Russia, September 3-7, 2001, Proceedings, pp. 285-292, 2001, Springer, 3-540-42522-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
52 | Chi-Him Wong, Yiu-Cheong Tam |
Negative Cycle Detection Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 652-663, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
52 | Goran Konjevod, Soohyun Oh, Andréa W. Richa |
Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings, pp. 435-450, 2002, Springer, 3-540-43400-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
52 | Wen-Lin Yang |
Solving the MCOP Problem Optimally. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: 27th Annual IEEE Conference on Local Computer Networks (LCN 2002), 6-8 November 2002, Tampa, FL, USA, Proceedings, pp. 100-109, 2002, IEEE Computer Society, 0-7695-1591-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
52 | Nitin Chandrachoodan, Shuvra S. Bhattacharyya, K. J. Ray Liu |
Adaptive negative cycle detection in dynamic graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (5) ![In: Proceedings of the 2001 International Symposium on Circuits and Systems, ISCAS 2001, Sydney, Australia, May 6-9, 2001, pp. 163-166, 2001, IEEE, 0-7803-6685-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
52 | Gianni Di Caro, Marco Dorigo |
Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPSN ![In: Parallel Problem Solving from Nature - PPSN V, 5th International Conference, Amsterdam, The Netherlands, September 27-30, 1998, Proceedings, pp. 673-682, 1998, Springer, 3-540-65078-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
52 | Charles E. Perkins, Pravin Bhagwat |
Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCOMM ![In: Proceedings of the ACM SIGCOMM 1994 Conference on Communications Architectures, Protocols and Applications, London, UK, August 31 - September 2, 1994, pp. 234-244, 1994, ACM, 0-89791-682-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
38 | Jialu Hu, László Kozma 0002 |
Non-adaptive Bellman-Ford: Yen's improvement is optimal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.10343, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
38 | Spyridon Drakakis, Constantine Kotropoulos |
Applying the Neural Bellman-Ford Model to the Single Source Shortest Path Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPRAM ![In: Proceedings of the 13th International Conference on Pattern Recognition Applications and Methods, ICPRAM 2024, Rome, Italy, February 24-26, 2024., pp. 386-393, 2024, SCITEPRESS, 978-989-758-684-2. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
38 | Shishir Singh Chauhan, Dilip Kumar |
Mode Search Optimization Algorithm for Traffic Prediction and Signal Controlling Using Bellman-Ford with TPFN Path Discovery Model Based on Deep LSTM Classifier. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SN Comput. Sci. ![In: SN Comput. Sci. 4(5), pp. 686, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Olga Timofeeva, Alexey Sannikov, Maria Stepanenko, Tatiana Balashova |
Modification of the Bellman-Ford Algorithm for Finding the Optimal Route in Multilayer Network Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. ![In: Comput. 11(4), pp. 74, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Pallapothala Tejaswini, Rajesh Doriya, Kaushlendra Sharma |
Efficient Mobile Robot Navigation with D* Lite and Bellman Ford Hybrid Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICISS ![In: Proceedings of the 2023 6th International Conference on Information Science and Systems, ICISS 2023, Edinburgh, United Kingdom, August 11-13, 2023, pp. 224-230, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Tomasz Kociumaka, Adam Polak 0001 |
Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands, pp. 72:1-72:10, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-295-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Silvio Lattanzi, Ola Svensson, Sergei Vassilvitskii |
Speeding Up Bellman Ford via Minimum Violation Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: International Conference on Machine Learning, ICML 2023, 23-29 July 2023, Honolulu, Hawaii, USA., pp. 18584-18598, 2023, PMLR. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
38 | Adam Polak 0001 |
Bellman-Ford is optimal for shortest hop-bounded paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.07325, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Zhaocheng Zhu, Zuobai Zhang, Louis-Pascal A. C. Xhonneux, Jian Tang 0005 |
Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2106.06935, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
38 | Guangjing He, Xinchang Zhang 0002, Ying Sun, Guowei Luo, Liyan Chen |
Contour line simplification method based on the two-level Bellman-Ford algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. GIS ![In: Trans. GIS 25(1), pp. 396-423, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
38 | Yuanqiu Mo, Lanlin Yu |
A Lyapunov analysis of the continuous-time adaptive Bellman-Ford algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Syst. Control. Lett. ![In: Syst. Control. Lett. 157, pp. 105045, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
38 | Mohsen Safari, Wytse Oortwijn, Marieke Huisman |
Automated Verification of the Parallel Bellman-Ford Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis - 28th International Symposium, SAS 2021, Chicago, IL, USA, October 17-19, 2021, Proceedings, pp. 346-358, 2021, Springer, 978-3-030-88805-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
38 | Zhaocheng Zhu, Zuobai Zhang, Louis-Pascal A. C. Xhonneux, Jian Tang 0005 |
Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual., pp. 29476-29490, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
38 | J. Mohan, Shweta M. Devanagaonkar, Vineeta V. Garur, A. Karthik 0006, K. Rohitaksha, A. B. Rajendra |
An Improved Approach for Eliminating the Loop in Hybrid Software Defined Network (SDN) Using Modified Bellman-Ford Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Interconnect. Networks ![In: J. Interconnect. Networks 20(4), pp. 2150001:1-2150001:15, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
38 | Alexander Weber 0004, Marcus Kreuzer, Alexander Knoll |
A generalized Bellman-Ford Algorithm for Application in Symbolic Optimal Control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2001.06231, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
38 | Alexander Weber 0004, Marcus Kreuzer, Alexander Knoll |
A generalized Bellman-Ford Algorithm for Application in Symbolic Optimal Control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECC ![In: 18th European Control Conference, ECC 2020, Virtual Event, Russia, May 12-15, 2020, pp. 2007-2014, 2020, IEEE, 978-3-90714-402-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
38 | Yuanqiu Mo, Soura Dasgupta, Jacob Beal |
Robustness of the Adaptive Bellman -Ford Algorithm: Global Stability and Ultimate Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Autom. Control. ![In: IEEE Trans. Autom. Control. 64(10), pp. 4121-4136, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
38 | Rama Devi Boddu, Kalitkar Kishan Rao, M. Asha Rani |
Application of Modified Bellman-Ford Algorithm for Cooperative Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Wirel. Pers. Commun. ![In: Wirel. Pers. Commun. 109(3), pp. 2025-2049, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
38 | |
Breaking the Bellman-Ford Shortest-Path Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1905.01325, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
38 | Yuanqiu Mo, Soura Dasgupta, Jacob Beal |
Global Uniform Asymptotic Stability of a Generalized Adaptive Bellman-Ford Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: 58th IEEE Conference on Decision and Control, CDC 2019, Nice, France, December 11-13, 2019, pp. 1868-1873, 2019, IEEE, 978-1-7281-1398-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
38 | Domenico Cantone, Pietro Maugeri, Stefano Scafiti |
A Potential-Based Variant of the Bellman-Ford Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Proceedings of the 20th Italian Conference on Theoretical Computer Science, ICTCS 2019, Como, Italy, September 9-11, 2019., pp. 122-135, 2019, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
38 | Stephan Friedrichs, Christoph Lenzen 0001 |
Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 65(6), pp. 43:1-43:55, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
38 | Ilya V. Afanasyev, Alexander S. Antonov, Dmitry A. Nikitenko, Vadim V. Voevodin, Vladimir V. Voevodin, Kazuhiko Komatsu, Osamu Watanabe, Akihiro Musa, Hiroaki Kobayashi |
Developing Efficient Implementations of Bellman-Ford and Forward-Backward Graph Algorithms for NEC SX-ACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Supercomput. Front. Innov. ![In: Supercomput. Front. Innov. 5(3), pp. 65-69, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
38 | Matthew L. Daggitt, Alexander J. T. Gurney, Timothy G. Griffin |
Asynchronous convergence of policy-rich distributed bellman-ford routing protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCOMM ![In: Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication, SIGCOMM 2018, Budapest, Hungary, August 20-25, 2018, pp. 103-116, 2018, ACM. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
38 | Yefim Dinitz, Rotem Itzhak |
Hybrid Bellman-Ford-Dijkstra algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Discrete Algorithms ![In: J. Discrete Algorithms 42, pp. 35-44, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
38 | Maher Helaoui |
Extended Shortest Path Problem - Generalized Dijkstra-Moore and Bellman-Ford Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICORES ![In: Proceedings of the 6th International Conference on Operations Research and Enterprise Systems, ICORES 2017, Porto, Portugal, February 23-25, 2017., pp. 306-313, 2017, SciTePress, 978-989-758-218-9. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
38 | Stasys Jukna, Georg Schnitger |
On the optimality of Bellman-Ford-Moore shortest path algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 628, pp. 101-109, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
38 | Federico Busato, Nicola Bombieri |
An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU Architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 27(8), pp. 2222-2233, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
38 | Soura Dasgupta, Jacob Beal |
A Lyapunov analysis for the robust stability of an adaptive Bellman-Ford algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: 55th IEEE Conference on Decision and Control, CDC 2016, Las Vegas, NV, USA, December 12-14, 2016, pp. 7282-7287, 2016, IEEE, 978-1-5090-1837-6. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
38 | Stephan Friedrichs, Christoph Lenzen 0001 |
Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, pp. 455-466, 2016, ACM, 978-1-4503-4210-0. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
38 | Stasys Jukna, Georg Schnitger |
On the Optimality of Bellman-Ford-Moore Shortest Path Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR15, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
38 | Stephan Friedrichs, Christoph Lenzen 0001 |
Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1509.09047, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
38 | In-Kyu Jeong, Jia Uddin, Myeongsu Kang, Cheol-Hong Kim, Jong-Myon Kim |
Accelerating a Bellman-Ford Routing Algorithm Using GPU. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCC ![In: Frontier and Innovation in Future Computing and Communications, Proceedings of the 2014 FTRA International Symposium on Frontier and Innovation in Future Computing and Communications, FCC 2014, Auckland, New Zealand, January 13-16, 2014, pp. 153-160, 2014, Springer, 978-94-017-8797-0. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
38 | Michael J. Bannister, David Eppstein |
Randomized Speedup of the Bellman-Ford Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANALCO ![In: Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2012, Kyoto, Japan, January 16, 2012, pp. 41-47, 2012, SIAM, 978-1-61197-213-9. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
38 | Manish Sharma |
Evaluation of Various Battery Models for Bellman Ford Ad hoc Routing Protocol in VANET Using Qualnet. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SocProS ![In: Proceedings of the Second International Conference on Soft Computing for Problem Solving, SocProS 2012, December 28-30, 2012, JK Lakshmipat University (JKLU), Jaipur, India, pp. 1101-1108, 2012, Springer, 978-81-322-1601-8. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
38 | Michael J. Bannister, David Eppstein |
Randomized Speedup of the Bellman-Ford Algorithm ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1111.5414, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
38 | Kevin R. Hutson, Terri L. Schlosser, Douglas R. Shier |
On the Distributed Bellman-Ford Algorithm and the Looping Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFORMS J. Comput. ![In: INFORMS J. Comput. 19(4), pp. 542-551, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Alpár Fancsali |
An Extension of the Bellman-Ford Algorithm for QoS Routing with Informational Entities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Informatica (Slovenia) ![In: Informatica (Slovenia) 27(4), pp. 469-481, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
38 | Xin Yuan |
On the extended Bellman-Ford algorithm to solve two-constrained quality of service routing problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCN ![In: Proceedings of the International Conference On Computer Communications and Networks (ICCCN 1999), October 11-13, 1999, Boston, MA, USA, pp. 304-310, 1999, IEEE, 0-7803-5794-9. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
38 | Dirceu Cavendish, Mario Gerla |
Internet QoS Routing Using the Bellman-Ford Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPN ![In: High Performance Networking, IFIP TC-6 Eigth International Conference on High Performance Networking (HPN'98), Vienna, Austria, September 21-25, 1998, pp. 627-646, 1998, Kluwer, 0-412-84660-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP BibTeX RDF |
|
38 | Baruch Awerbuch, Amotz Bar-Noy, Madan Gopal |
Approximate distributed Bellman-Ford algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 42(8), pp. 2515-2517, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
38 | Baruch Awerbuch, Amotz Bar-Noy, Madan Gopal |
Approximate Distributed Bellman-Ford Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: Proceedings IEEE INFOCOM '91, The Conference on Computer Communications, Tenth Annual Joint Conference of the IEEE Computer and Communications Societies, Networking in the 90s, Bal Harbour, Florida, USA, April 7-11, 1991, pp. 1206-1213, 1991, IEEE Computer Society, 0-87942-694-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
38 | Ramsey W. Haddad, Alejandro A. Schäffer |
Recognizing Bellman-Ford-Orderable Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 1(4), pp. 447-471, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
26 | Supriya Krishnamurthy, John Ardelius, Erik Aurell, Mads Dam, Rolf Stadler, Fetahi Zebenigus Wuhib |
Brief announcement: the accuracy of tree-based counting in dynamic networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 291-292, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
distributed spanning tree, markov model |
26 | Petar Djukic, Shahrokh Valaee |
Delay aware link scheduling for multi-hop TDMA wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 17(3), pp. 870-883, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
TDMA scheduling algorithms, scheduling delay, stop-and-go queueing |
26 | Thomas Gawlitza, Jérôme Leroux, Jan Reineke 0001, Helmut Seidl, Grégoire Sutre, Reinhard Wilhelm |
Polynomial Precise Interval Analysis Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Efficient Algorithms ![In: Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, pp. 422-437, 2009, Springer, 978-3-642-03455-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Changjing Wang, Jinyun Xue |
Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings, pp. 27-39, 2009, Springer, 978-3-642-02269-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
High-trustworthy, Path problem, Generic algorithm, Formal derivation, Dioid |
26 | Deqiang Chen, Martin Haenggi, J. Nicholas Laneman |
Distributed spectrum-efficient routing algorithms in wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 7(12-2), pp. 5297-5305, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Waseem Ahmed Kamal, Raza Samar |
A mission planning approach for UAV applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008, December 9-11, 2008, Cancún, Mexico, pp. 3101-3106, 2008, IEEE, 978-1-4244-3123-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Nazanin Rahnavard, Badri N. Vellambi, Faramarz Fekri |
Distributed Protocols for Finding Low-Cost Broadcast and Multicast Trees in Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SECON ![In: Proceedings of the Fifth Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2008, June 16-20, 2008, Crowne Plaza, San Francisco International Airport, California, USA, pp. 551-559, 2008, IEEE, 978-1-4244-1777-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Petar Djukic, Shahrokh Valaee |
Quality-of-Service Provisioning for Multi-service TDMA Mesh Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITC ![In: Managing Traffic Performance in Converged Networks, 20th International Teletraffic Congress, ITC20 2007, Ottawa, Canada, June 17-21, 2007, Proceedings, pp. 841-852, 2007, Springer, 978-3-540-72989-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Suranga Chandima Nanayakkara, Dipti Srinivasan, Lai Wei Lup, Xavier German, Elizabeth A. Taylor, S. H. Ong 0001 |
Genetic Algorithm based route planner for large urban street networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Congress on Evolutionary Computation ![In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007, 25-28 September 2007, Singapore, pp. 4469-4474, 2007, IEEE, 978-1-4244-1339-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | K. Subramani 0001, Kamesh Madduri |
Accomplishing Approximate FCFS Fairness Without Queues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HiPC ![In: High Performance Computing - HiPC 2007, 14th International Conference, Goa, India, December 18-21, 2007, Proceedings, pp. 540-551, 2007, Springer, 978-3-540-77219-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Sartaj Sahni, Nageswara S. V. Rao, Sanjay Ranka, Yan Li 0097, Eun-Sung Jung, Nara Kamath |
Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICN ![In: Sixth International Conference on Networking (ICN 2007), 22-28 April 2007, Sainte-Luce, Martinique, France, pp. 47, 2007, IEEE Computer Society, 978-0-7695-2805-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
backend signaling, MPLS/GMPLS distributed implementation, multi-domain scheduling, resource scheduling |
26 | Mingming Lu, Jie Wu 0001 |
Utility-Based Routing in Communication Networks with Unstable Links. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCN ![In: Proceedings of the 16th International Conference on Computer Communications and Networks, IEEE ICCCN 2007, Turtle Bay Resort, Honolulu, Hawaii, USA, August 13-16, 2007, pp. 436-441, 2007, IEEE, 978-1-4244-1251-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Yu Wang, Lemin Li, Du Xu |
A Multi-constrained Quality of Service Routing Based on Metrics Transform. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNSC ![In: Proceedings of the IEEE International Conference on Networking, Sensing and Control, ICNSC 2007, London, UK, 15-17 April 2007, pp. 525-529, 2007, IEEE, 1-4244-1076-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Deqiang Chen, Martin Haenggi, J. Nicholas Laneman |
Distributed Spectrum-Efficient Routing Algorithms in Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CISS ![In: Proceedings of the 41st Annual Conference on Information Sciences and Systems, CISS 2007, 14-16 March 2007, Johns Hopkins University, Department of Electrical Engineering, Baltimore, MD, USA, pp. 649-654, 2007, IEEE, 1-4244-1037-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Sung-Soo Kim, Seung B. Ahn |
Adaptive Routing Algorithm Using Evolution Program for Multiple Shortest Paths in DRGS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICHIT ![In: Advances in Hybrid Information Technology, First International Conference, ICHIT 2006, Jeju Island, Korea, November 9-11, 2006, Revised Selected Papers, pp. 292-301, 2006, Springer, 978-3-540-77367-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Evolution program, Adaptive routing algorithm using evolution program (ARAEP), Dynamic route guidance system, Shortest path |
26 | X. Liu, J. Zhang |
A Capacitated Production Planning with Outsourcing: A General Model and Its Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (1) ![In: Intelligent Computing, International Conference on Intelligent Computing, ICIC 2006, Kunming, China, August 16-19, 2006. Proceedings, Part I, pp. 997-1002, 2006, Springer, 3-540-37271-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Jean-Michel Hélary, Alessia Milani |
About the Efficiency of Partial Replication to Implement Distributed Shared Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 2006 International Conference on Parallel Processing (ICPP 2006), 14-18 August 2006, Columbus, Ohio, USA, pp. 263-270, 2006, IEEE Computer Society, 0-7695-2636-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea |
The SAT-based Approach to Separation Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 35(1-3), pp. 237-263, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
SAT-based decision procedures, separation logic |
26 | Piotr Sankowski |
Shortest Paths in Matrix Multiplication Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 770-778, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Athanassios Boulis, Mani B. Srivastava |
Distributed Low-Overhead Energy-Efficient Routing for Sensory Networks via Topology Management and Path Diversity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PerCom ![In: 3rd IEEE International Conference on Pervasive Computing and Communications (PerCom 2005), 8-12 March 2005, Kauai Island, HI, USA, pp. 107-116, 2005, IEEE Computer Society, 0-7695-2299-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Zhanfeng Jia, Rajarshi Gupta, Jean C. Walrand, Pravin Varaiya |
Bandwidth Guaranteed Routing for Ad Hoc Networks with Interference Consideration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCC ![In: Proceedings of the 10th IEEE Symposium on Computers and Communications (ISCC 2005), 27-30 June 2005, Murcia, Cartagena, Spain, pp. 3-9, 2005, IEEE Computer Society, 0-7695-2373-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Yi-Cheng Huang, Sheng-Yan Chuang, Sheng-De Wang |
A Dynamic Node Degree Management Scheme for Energy-efficient Routing Protocols in Wireless Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS (2) ![In: 11th International Conference on Parallel and Distributed Systems, ICPADS 2005, Fuduoka, Japan, July 20-22, 2005, pp. 7-11, 2005, IEEE Computer Society, 0-7695-2281-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
ad hoc network, energy consumption, collision, RNG |
26 | Xiaoqing Zhu, Bernd Girod |
A Distributed Algorithm for Congestion-Minimized Multi-Path Routing Over Ad-Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICME ![In: Proceedings of the 2005 IEEE International Conference on Multimedia and Expo, ICME 2005, July 6-9, 2005, Amsterdam, The Netherlands, pp. 1484-1487, 2005, IEEE Computer Society, 0-7803-9331-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | K. Subramani 0001, Dejan Desovski |
On the Empirical Efficiency of the Vertex Contraction Algorithm for Detecting Negative Cost Cyles in Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (1) ![In: Computational Science - ICCS 2005, 5th International Conference, Atlanta, GA, USA, May 22-25, 2005, Proceedings, Part I, pp. 180-187, 2005, Springer, 3-540-26032-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Basabi Chakraborty |
GA-Based Multiple Route Selection for Car Navigation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AACC ![In: Applied Computing, Second Asian Applied Computing Conference, AACC 2004, Kathmandu, Nepal, October 29-31, 2004. Proceedings, pp. 76-83, 2004, Springer, 3-540-23659-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
26 | Wendong Xiao, Boon-Hee Soong, Choi Look Law, Yong Liang Guan 0001 |
Improved Limited Path Heuristic Algorithm for Multi-constrained QoS Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCAT ![In: Parallel and Distributed Computing: Applications and Technologies, 5th International Conference, PDCAT 2004, Singapore, December 8-10, 2004, Proceedings, pp. 164-167, 2004, Springer, 3-540-24013-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
26 | Debasish Chakraborty, Goutam Chakraborty, Norio Shiratori |
A dynamic multicast routing satisfying multiple QoS constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Netw. Manag. ![In: Int. J. Netw. Manag. 13(5), pp. 321-335, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Dan Pei, Lan Wang, Daniel Massey, Shyhtsun Felix Wu, Lixia Zhang 0001 |
A Study of Packet Delivery Performance during Routing Convergence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DSN ![In: 2003 International Conference on Dependable Systems and Networks (DSN 2003), 22-25 June 2003, San Francisco, CA, USA, Proceedings, pp. 183-192, 2003, IEEE Computer Society, 0-7695-1952-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Jens Gerlach, Joachim Kneis |
Generic Programming for Scientific Computing in C++, Java, and C#. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPT ![In: Advanced Parallel Programming Technologies, 5th International Workshop, APPT 2003, Xiamen, China, September 17-19, 2003, Proceedings, pp. 301-310, 2003, Springer, 3-540-20054-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | K. Subramani 0001, Lisa Kovalchick |
Contraction versus Relaxation: A Comparison of Two Approaches for the Negative Cost Cycle Detection Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science ![In: Computational Science - ICCS 2003, International Conference, Melbourne, Australia and St. Petersburg, Russia, June 2-4, 2003. Proceedings, Part III, pp. 377-387, 2003, Springer, 3-540-40196-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Xin Yuan 0001 |
Heuristic algorithms for multiconstrained quality-of-service routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 10(2), pp. 244-256, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
quality of service, routing |
26 | Roch Guérin, Ariel Orda |
Computing shortest paths for any number of hops. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 10(5), pp. 613-620, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
hop-restricted shortest paths, maximum bandwidth, minimum delay, networks, quality-of-service routing |
26 | Franz-Josef Brandenburg |
Cycles in Generalized Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers, pp. 47-56, 2002, Springer, 3-540-00331-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
26 | Chao-Ju Hou |
Routing Virtual Circuits with Temporal QoS Requirements in Virtual Path-Based ATM Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 48(11), pp. 1228-1243, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
virtual circuit setup, unicast/multicast, temporal QoS, real-time channel model, distributed shortest path algorithms, virtual circuits, Virtual paths |
26 | Ulrich Meyer 0001, Peter Sanders 0001 |
Delta-Stepping: A Parallel Single Source Shortest Path Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings, pp. 393-404, 1998, Springer, 3-540-64848-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
26 | J. J. Garcia-Luna-Aceves, Marcelo Spohn |
Scalable Link-State Internet Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: 1998 International Conference on Network Protocols (ICNP '98), October 13-16, 1998, Austin, Texas, USA, pp. 52-61, 1998, IEEE Computer Society, 0-8186-8988-9. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
26 | Chotipat Pornavalai, Goutam Chakraborty, Norio Shiratori |
QoS based routing algorithm in integrated services packet networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: 1997 International Conference on Network Protocols (ICNP '97), 28-31 October 1997, Atlanta, GA, USA, pp. 167-174, 1997, IEEE Computer Society, 0-8186-8061-X. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
26 | Stavros G. Kolliopoulos, Clifford Stein 0001 |
Finding Real-Valued Single-Source Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings, pp. 94-104, 1996, Springer, 3-540-61310-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
26 | Jochen Behrens, J. J. Garcia-Luna-Aceves |
Distributed, Scalable Routing Based on Link-State Vectors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCOMM ![In: Proceedings of the ACM SIGCOMM 1994 Conference on Communications Architectures, Protocols and Applications, London, UK, August 31 - September 2, 1994, pp. 136-147, 1994, ACM, 0-89791-682-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
26 | A. Udaya Shankar, Cengiz Alaettinoglu, Ibrahim Matta, Klaudia Dussa-Zieger |
Performance Comparison of Routing Protocols using MaRS: Distance-Vector versus Link-State. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS ![In: Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, Newport, Rhode Island, USA, June 1-5, 1992, pp. 181-192, 1992, ACM, 0-89791-507-0. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
ARPANET |
Displaying result #1 - #96 of 96 (100 per page; Change: )
|
|