The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Bellman-Ford (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1988-1999 (15) 2000-2004 (16) 2005-2007 (20) 2008-2015 (15) 2016-2020 (17) 2021-2024 (13)
Publication types (Num. hits)
article(32) inproceedings(64)
Venues (Conferences, Journals, ...)
CoRR(7) ESA(4) SIGCOMM(4) CDC(3) IEEE/ACM Trans. Netw.(3) ICCCN(2) ICNP(2) LCN(2) AACC(1) AINA(1) ANALCO(1) APPT(1) ASP-DAC(1) CISS(1) Comput.(1) DSN(1) More (+10 of total 77)
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
169Xue 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 J. Comput. Sci. Technol. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Bellman-Ford, void (hole), wireless sensor network, scalability, geographic routing
105Hideki Tode, Zhu Tianwei, Shouhei Nishi, Koso Murakami A Route Design Algorithm for Multiple-Encoding Optical CDM Switching Network. Search on Bibsonomy LCN The full citation details ... 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
91Mohammad Baharloo, Reza Hajisheykhi, Mohammad Arjomand, Amir-Hossein Jahangir An Analytical Performance Evaluation for WSNs Using Loop-Free Bellman Ford Protocol. Search on Bibsonomy AINA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Analytical mode, Loop-Free Bellman Ford Protocol, Wireless Sensor Network, Queuing system
90C. 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 SIGCOMM The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
78Daniel Sawitzki Experimental Studies of Symbolic Shortest-Path Algorithms. Search on Bibsonomy WEA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
64Mongkol Ekpanyapong, Thaisiri Watewai, Sung Kyu Lim Statistical Bellman-Ford algorithm with an application to retiming. Search on Bibsonomy ASP-DAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
64A. S. Nepomniaschaya An Associative Version of the Bellman-Ford Algorithm for Finding the Shortest Paths in Directed Graphs. Search on Bibsonomy PaCT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
52Chi-Him Wong, Yiu-Cheong Tam Negative Cycle Detection Problem. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
52Goran Konjevod, Soohyun Oh, Andréa W. Richa Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities. Search on Bibsonomy LATIN The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
52Wen-Lin Yang Solving the MCOP Problem Optimally. Search on Bibsonomy LCN The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
52Nitin Chandrachoodan, Shuvra S. Bhattacharyya, K. J. Ray Liu Adaptive negative cycle detection in dynamic graphs. Search on Bibsonomy ISCAS (5) The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
52Gianni Di Caro, Marco Dorigo Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks. Search on Bibsonomy PPSN The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
52Charles E. Perkins, Pravin Bhagwat Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers. Search on Bibsonomy SIGCOMM The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
38Jialu Hu, László Kozma 0002 Non-adaptive Bellman-Ford: Yen's improvement is optimal. Search on Bibsonomy CoRR The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
38Spyridon Drakakis, Constantine Kotropoulos Applying the Neural Bellman-Ford Model to the Single Source Shortest Path Problem. Search on Bibsonomy ICPRAM The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
38Shishir 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 SN Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Olga 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 Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Pallapothala Tejaswini, Rajesh Doriya, Kaushlendra Sharma Efficient Mobile Robot Navigation with D* Lite and Bellman Ford Hybrid Algorithm. Search on Bibsonomy ICISS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Tomasz Kociumaka, Adam Polak 0001 Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths. Search on Bibsonomy ESA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Silvio Lattanzi, Ola Svensson, Sergei Vassilvitskii Speeding Up Bellman Ford via Minimum Violation Permutations. Search on Bibsonomy ICML The full citation details ... 2023 DBLP  BibTeX  RDF
38Adam Polak 0001 Bellman-Ford is optimal for shortest hop-bounded paths. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Zhaocheng 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 CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
38Guangjing 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 Trans. GIS The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
38Yuanqiu Mo, Lanlin Yu A Lyapunov analysis of the continuous-time adaptive Bellman-Ford algorithm. Search on Bibsonomy Syst. Control. Lett. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
38Mohsen Safari, Wytse Oortwijn, Marieke Huisman Automated Verification of the Parallel Bellman-Ford Algorithm. Search on Bibsonomy SAS The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
38Zhaocheng 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 NeurIPS The full citation details ... 2021 DBLP  BibTeX  RDF
38J. 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 J. Interconnect. Networks The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
38Alexander Weber 0004, Marcus Kreuzer, Alexander Knoll A generalized Bellman-Ford Algorithm for Application in Symbolic Optimal Control. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
38Alexander Weber 0004, Marcus Kreuzer, Alexander Knoll A generalized Bellman-Ford Algorithm for Application in Symbolic Optimal Control. Search on Bibsonomy ECC The full citation details ... 2020 DBLP  BibTeX  RDF
38Yuanqiu Mo, Soura Dasgupta, Jacob Beal Robustness of the Adaptive Bellman -Ford Algorithm: Global Stability and Ultimate Bounds. Search on Bibsonomy IEEE Trans. Autom. Control. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
38Rama Devi Boddu, Kalitkar Kishan Rao, M. Asha Rani Application of Modified Bellman-Ford Algorithm for Cooperative Communication. Search on Bibsonomy Wirel. Pers. Commun. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
38 Breaking the Bellman-Ford Shortest-Path Bound. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
38Yuanqiu Mo, Soura Dasgupta, Jacob Beal Global Uniform Asymptotic Stability of a Generalized Adaptive Bellman-Ford Algorithm. Search on Bibsonomy CDC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
38Domenico Cantone, Pietro Maugeri, Stefano Scafiti A Potential-Based Variant of the Bellman-Ford Algorithm. Search on Bibsonomy ICTCS The full citation details ... 2019 DBLP  BibTeX  RDF
38Stephan Friedrichs, Christoph Lenzen 0001 Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
38Ilya 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 Supercomput. Front. Innov. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
38Matthew L. Daggitt, Alexander J. T. Gurney, Timothy G. Griffin Asynchronous convergence of policy-rich distributed bellman-ford routing protocols. Search on Bibsonomy SIGCOMM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
38Yefim Dinitz, Rotem Itzhak Hybrid Bellman-Ford-Dijkstra algorithm. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
38Maher Helaoui Extended Shortest Path Problem - Generalized Dijkstra-Moore and Bellman-Ford Algorithms. Search on Bibsonomy ICORES The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
38Stasys Jukna, Georg Schnitger On the optimality of Bellman-Ford-Moore shortest path algorithm. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
38Federico Busato, Nicola Bombieri An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU Architectures. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
38Soura Dasgupta, Jacob Beal A Lyapunov analysis for the robust stability of an adaptive Bellman-Ford algorithm. Search on Bibsonomy CDC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
38Stephan Friedrichs, Christoph Lenzen 0001 Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford. Search on Bibsonomy SPAA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
38Stasys Jukna, Georg Schnitger On the Optimality of Bellman-Ford-Moore Shortest Path Algorithm. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2015 DBLP  BibTeX  RDF
38Stephan Friedrichs, Christoph Lenzen 0001 Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
38In-Kyu Jeong, Jia Uddin, Myeongsu Kang, Cheol-Hong Kim, Jong-Myon Kim Accelerating a Bellman-Ford Routing Algorithm Using GPU. Search on Bibsonomy FCC The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
38Michael J. Bannister, David Eppstein Randomized Speedup of the Bellman-Ford Algorithm. Search on Bibsonomy ANALCO The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
38Manish Sharma Evaluation of Various Battery Models for Bellman Ford Ad hoc Routing Protocol in VANET Using Qualnet. Search on Bibsonomy SocProS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
38Michael J. Bannister, David Eppstein Randomized Speedup of the Bellman-Ford Algorithm Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
38Kevin R. Hutson, Terri L. Schlosser, Douglas R. Shier On the Distributed Bellman-Ford Algorithm and the Looping Problem. Search on Bibsonomy INFORMS J. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
38Alpár Fancsali An Extension of the Bellman-Ford Algorithm for QoS Routing with Informational Entities. Search on Bibsonomy Informatica (Slovenia) The full citation details ... 2003 DBLP  BibTeX  RDF
38Xin Yuan On the extended Bellman-Ford algorithm to solve two-constrained quality of service routing problems. Search on Bibsonomy ICCCN The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
38Dirceu Cavendish, Mario Gerla Internet QoS Routing Using the Bellman-Ford Algorithm. Search on Bibsonomy HPN The full citation details ... 1998 DBLP  BibTeX  RDF
38Baruch Awerbuch, Amotz Bar-Noy, Madan Gopal Approximate distributed Bellman-Ford algorithms. Search on Bibsonomy IEEE Trans. Commun. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
38Baruch Awerbuch, Amotz Bar-Noy, Madan Gopal Approximate Distributed Bellman-Ford Algorithms. Search on Bibsonomy INFOCOM The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
38Ramsey W. Haddad, Alejandro A. Schäffer Recognizing Bellman-Ford-Orderable Graphs. Search on Bibsonomy SIAM J. Discret. Math. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
26Supriya 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 PODC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF distributed spanning tree, markov model
26Petar Djukic, Shahrokh Valaee Delay aware link scheduling for multi-hop TDMA wireless networks. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF TDMA scheduling algorithms, scheduling delay, stop-and-go queueing
26Thomas Gawlitza, Jérôme Leroux, Jan Reineke 0001, Helmut Seidl, Grégoire Sutre, Reinhard Wilhelm Polynomial Precise Interval Analysis Revisited. Search on Bibsonomy Efficient Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
26Changjing Wang, Jinyun Xue Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems. Search on Bibsonomy FAW The full citation details ... 2009 DBLP  DOI  BibTeX  RDF High-trustworthy, Path problem, Generic algorithm, Formal derivation, Dioid
26Deqiang Chen, Martin Haenggi, J. Nicholas Laneman Distributed spectrum-efficient routing algorithms in wireless networks. Search on Bibsonomy IEEE Trans. Wirel. Commun. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
26Waseem Ahmed Kamal, Raza Samar A mission planning approach for UAV applications. Search on Bibsonomy CDC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
26Nazanin Rahnavard, Badri N. Vellambi, Faramarz Fekri Distributed Protocols for Finding Low-Cost Broadcast and Multicast Trees in Wireless Networks. Search on Bibsonomy SECON The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
26Petar Djukic, Shahrokh Valaee Quality-of-Service Provisioning for Multi-service TDMA Mesh Networks. Search on Bibsonomy ITC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
26Suranga 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 IEEE Congress on Evolutionary Computation The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
26K. Subramani 0001, Kamesh Madduri Accomplishing Approximate FCFS Fairness Without Queues. Search on Bibsonomy HiPC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
26Sartaj 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 ICN The full citation details ... 2007 DBLP  DOI  BibTeX  RDF backend signaling, MPLS/GMPLS distributed implementation, multi-domain scheduling, resource scheduling
26Mingming Lu, Jie Wu 0001 Utility-Based Routing in Communication Networks with Unstable Links. Search on Bibsonomy ICCCN The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
26Yu Wang, Lemin Li, Du Xu A Multi-constrained Quality of Service Routing Based on Metrics Transform. Search on Bibsonomy ICNSC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
26Deqiang Chen, Martin Haenggi, J. Nicholas Laneman Distributed Spectrum-Efficient Routing Algorithms in Wireless Networks. Search on Bibsonomy CISS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
26Sung-Soo Kim, Seung B. Ahn Adaptive Routing Algorithm Using Evolution Program for Multiple Shortest Paths in DRGS. Search on Bibsonomy ICHIT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Evolution program, Adaptive routing algorithm using evolution program (ARAEP), Dynamic route guidance system, Shortest path
26X. Liu, J. Zhang A Capacitated Production Planning with Outsourcing: A General Model and Its Algorithm. Search on Bibsonomy ICIC (1) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
26Jean-Michel Hélary, Alessia Milani About the Efficiency of Partial Replication to Implement Distributed Shared Memory. Search on Bibsonomy ICPP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
26Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea The SAT-based Approach to Separation Logic. Search on Bibsonomy J. Autom. Reason. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF SAT-based decision procedures, separation logic
26Piotr Sankowski Shortest Paths in Matrix Multiplication Time. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
26Athanassios Boulis, Mani B. Srivastava Distributed Low-Overhead Energy-Efficient Routing for Sensory Networks via Topology Management and Path Diversity. Search on Bibsonomy PerCom The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
26Zhanfeng Jia, Rajarshi Gupta, Jean C. Walrand, Pravin Varaiya Bandwidth Guaranteed Routing for Ad Hoc Networks with Interference Consideration. Search on Bibsonomy ISCC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
26Yi-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 ICPADS (2) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF ad hoc network, energy consumption, collision, RNG
26Xiaoqing Zhu, Bernd Girod A Distributed Algorithm for Congestion-Minimized Multi-Path Routing Over Ad-Hoc Networks. Search on Bibsonomy ICME The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
26K. Subramani 0001, Dejan Desovski On the Empirical Efficiency of the Vertex Contraction Algorithm for Detecting Negative Cost Cyles in Networks. Search on Bibsonomy International Conference on Computational Science (1) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
26Basabi Chakraborty GA-Based Multiple Route Selection for Car Navigation. Search on Bibsonomy AACC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
26Wendong Xiao, Boon-Hee Soong, Choi Look Law, Yong Liang Guan 0001 Improved Limited Path Heuristic Algorithm for Multi-constrained QoS Routing. Search on Bibsonomy PDCAT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
26Debasish Chakraborty, Goutam Chakraborty, Norio Shiratori A dynamic multicast routing satisfying multiple QoS constraints. Search on Bibsonomy Int. J. Netw. Manag. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
26Dan Pei, Lan Wang, Daniel Massey, Shyhtsun Felix Wu, Lixia Zhang 0001 A Study of Packet Delivery Performance during Routing Convergence. Search on Bibsonomy DSN The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
26Jens Gerlach, Joachim Kneis Generic Programming for Scientific Computing in C++, Java, and C#. Search on Bibsonomy APPT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
26K. Subramani 0001, Lisa Kovalchick Contraction versus Relaxation: A Comparison of Two Approaches for the Negative Cost Cycle Detection Problem. Search on Bibsonomy International Conference on Computational Science The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
26Xin Yuan 0001 Heuristic algorithms for multiconstrained quality-of-service routing. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF quality of service, routing
26Roch Guérin, Ariel Orda Computing shortest paths for any number of hops. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF hop-restricted shortest paths, maximum bandwidth, minimum delay, networks, quality-of-service routing
26Franz-Josef Brandenburg Cycles in Generalized Networks. Search on Bibsonomy WG The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
26Chao-Ju Hou Routing Virtual Circuits with Temporal QoS Requirements in Virtual Path-Based ATM Networks. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1999 DBLP  DOI  BibTeX  RDF virtual circuit setup, unicast/multicast, temporal QoS, real-time channel model, distributed shortest path algorithms, virtual circuits, Virtual paths
26Ulrich Meyer 0001, Peter Sanders 0001 Delta-Stepping: A Parallel Single Source Shortest Path Algorithm. Search on Bibsonomy ESA The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
26J. J. Garcia-Luna-Aceves, Marcelo Spohn Scalable Link-State Internet Routing. Search on Bibsonomy ICNP The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
26Chotipat Pornavalai, Goutam Chakraborty, Norio Shiratori QoS based routing algorithm in integrated services packet networks. Search on Bibsonomy ICNP The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
26Stavros G. Kolliopoulos, Clifford Stein 0001 Finding Real-Valued Single-Source Shortest Paths. Search on Bibsonomy IPCO The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
26Jochen Behrens, J. J. Garcia-Luna-Aceves Distributed, Scalable Routing Based on Link-State Vectors. Search on Bibsonomy SIGCOMM The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
26A. Udaya Shankar, Cengiz Alaettinoglu, Ibrahim Matta, Klaudia Dussa-Zieger Performance Comparison of Routing Protocols using MaRS: Distance-Vector versus Link-State. Search on Bibsonomy SIGMETRICS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF ARPANET
Displaying result #1 - #96 of 96 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license