|
|
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. |
J. Comput. Sci. Technol. |
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. |
LCN |
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. |
AINA |
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. |
SIGCOMM |
1989 |
DBLP DOI BibTeX RDF |
|
78 | Daniel Sawitzki |
Experimental Studies of Symbolic Shortest-Path Algorithms. |
WEA |
2004 |
DBLP DOI BibTeX RDF |
|
64 | Mongkol Ekpanyapong, Thaisiri Watewai, Sung Kyu Lim |
Statistical Bellman-Ford algorithm with an application to retiming. |
ASP-DAC |
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. |
PaCT |
2001 |
DBLP DOI BibTeX RDF |
|
52 | Chi-Him Wong, Yiu-Cheong Tam |
Negative Cycle Detection Problem. |
ESA |
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. |
LATIN |
2002 |
DBLP DOI BibTeX RDF |
|
52 | Wen-Lin Yang |
Solving the MCOP Problem Optimally. |
LCN |
2002 |
DBLP DOI BibTeX RDF |
|
52 | Nitin Chandrachoodan, Shuvra S. Bhattacharyya, K. J. Ray Liu |
Adaptive negative cycle detection in dynamic graphs. |
ISCAS (5) |
2001 |
DBLP DOI BibTeX RDF |
|
52 | Gianni Di Caro, Marco Dorigo |
Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks. |
PPSN |
1998 |
DBLP DOI BibTeX RDF |
|
52 | Charles E. Perkins, Pravin Bhagwat |
Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers. |
SIGCOMM |
1994 |
DBLP DOI BibTeX RDF |
|
38 | Jialu Hu, László Kozma 0002 |
Non-adaptive Bellman-Ford: Yen's improvement is optimal. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
38 | Spyridon Drakakis, Constantine Kotropoulos |
Applying the Neural Bellman-Ford Model to the Single Source Shortest Path Problem. |
ICPRAM |
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. |
SN Comput. Sci. |
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. |
Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Pallapothala Tejaswini, Rajesh Doriya, Kaushlendra Sharma |
Efficient Mobile Robot Navigation with D* Lite and Bellman Ford Hybrid Algorithm. |
ICISS |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Tomasz Kociumaka, Adam Polak 0001 |
Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths. |
ESA |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Silvio Lattanzi, Ola Svensson, Sergei Vassilvitskii |
Speeding Up Bellman Ford via Minimum Violation Permutations. |
ICML |
2023 |
DBLP BibTeX RDF |
|
38 | Adam Polak 0001 |
Bellman-Ford is optimal for shortest hop-bounded paths. |
CoRR |
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. |
CoRR |
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. |
Trans. GIS |
2021 |
DBLP DOI BibTeX RDF |
|
38 | Yuanqiu Mo, Lanlin Yu |
A Lyapunov analysis of the continuous-time adaptive Bellman-Ford algorithm. |
Syst. Control. Lett. |
2021 |
DBLP DOI BibTeX RDF |
|
38 | Mohsen Safari, Wytse Oortwijn, Marieke Huisman |
Automated Verification of the Parallel Bellman-Ford Algorithm. |
SAS |
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. |
NeurIPS |
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. |
J. Interconnect. Networks |
2020 |
DBLP DOI BibTeX RDF |
|
38 | Alexander Weber 0004, Marcus Kreuzer, Alexander Knoll |
A generalized Bellman-Ford Algorithm for Application in Symbolic Optimal Control. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
38 | Alexander Weber 0004, Marcus Kreuzer, Alexander Knoll |
A generalized Bellman-Ford Algorithm for Application in Symbolic Optimal Control. |
ECC |
2020 |
DBLP BibTeX RDF |
|
38 | Yuanqiu Mo, Soura Dasgupta, Jacob Beal |
Robustness of the Adaptive Bellman -Ford Algorithm: Global Stability and Ultimate Bounds. |
IEEE Trans. Autom. Control. |
2019 |
DBLP DOI BibTeX RDF |
|
38 | Rama Devi Boddu, Kalitkar Kishan Rao, M. Asha Rani |
Application of Modified Bellman-Ford Algorithm for Cooperative Communication. |
Wirel. Pers. Commun. |
2019 |
DBLP DOI BibTeX RDF |
|
38 | |
Breaking the Bellman-Ford Shortest-Path Bound. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
38 | Yuanqiu Mo, Soura Dasgupta, Jacob Beal |
Global Uniform Asymptotic Stability of a Generalized Adaptive Bellman-Ford Algorithm. |
CDC |
2019 |
DBLP DOI BibTeX RDF |
|
38 | Domenico Cantone, Pietro Maugeri, Stefano Scafiti |
A Potential-Based Variant of the Bellman-Ford Algorithm. |
ICTCS |
2019 |
DBLP BibTeX RDF |
|
38 | Stephan Friedrichs, Christoph Lenzen 0001 |
Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford. |
J. ACM |
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. |
Supercomput. Front. Innov. |
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. |
SIGCOMM |
2018 |
DBLP DOI BibTeX RDF |
|
38 | Yefim Dinitz, Rotem Itzhak |
Hybrid Bellman-Ford-Dijkstra algorithm. |
J. Discrete Algorithms |
2017 |
DBLP DOI BibTeX RDF |
|
38 | Maher Helaoui |
Extended Shortest Path Problem - Generalized Dijkstra-Moore and Bellman-Ford Algorithms. |
ICORES |
2017 |
DBLP DOI BibTeX RDF |
|
38 | Stasys Jukna, Georg Schnitger |
On the optimality of Bellman-Ford-Moore shortest path algorithm. |
Theor. Comput. Sci. |
2016 |
DBLP DOI BibTeX RDF |
|
38 | Federico Busato, Nicola Bombieri |
An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU Architectures. |
IEEE Trans. Parallel Distributed Syst. |
2016 |
DBLP DOI BibTeX RDF |
|
38 | Soura Dasgupta, Jacob Beal |
A Lyapunov analysis for the robust stability of an adaptive Bellman-Ford algorithm. |
CDC |
2016 |
DBLP DOI BibTeX RDF |
|
38 | Stephan Friedrichs, Christoph Lenzen 0001 |
Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford. |
SPAA |
2016 |
DBLP DOI BibTeX RDF |
|
38 | Stasys Jukna, Georg Schnitger |
On the Optimality of Bellman-Ford-Moore Shortest Path Algorithm. |
Electron. Colloquium Comput. Complex. |
2015 |
DBLP BibTeX RDF |
|
38 | Stephan Friedrichs, Christoph Lenzen 0001 |
Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford. |
CoRR |
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. |
FCC |
2014 |
DBLP DOI BibTeX RDF |
|
38 | Michael J. Bannister, David Eppstein |
Randomized Speedup of the Bellman-Ford Algorithm. |
ANALCO |
2012 |
DBLP DOI BibTeX RDF |
|
38 | Manish Sharma |
Evaluation of Various Battery Models for Bellman Ford Ad hoc Routing Protocol in VANET Using Qualnet. |
SocProS |
2012 |
DBLP DOI BibTeX RDF |
|
38 | Michael J. Bannister, David Eppstein |
Randomized Speedup of the Bellman-Ford Algorithm |
CoRR |
2011 |
DBLP BibTeX RDF |
|
38 | Kevin R. Hutson, Terri L. Schlosser, Douglas R. Shier |
On the Distributed Bellman-Ford Algorithm and the Looping Problem. |
INFORMS J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Alpár Fancsali |
An Extension of the Bellman-Ford Algorithm for QoS Routing with Informational Entities. |
Informatica (Slovenia) |
2003 |
DBLP BibTeX RDF |
|
38 | Xin Yuan |
On the extended Bellman-Ford algorithm to solve two-constrained quality of service routing problems. |
ICCCN |
1999 |
DBLP DOI BibTeX RDF |
|
38 | Dirceu Cavendish, Mario Gerla |
Internet QoS Routing Using the Bellman-Ford Algorithm. |
HPN |
1998 |
DBLP BibTeX RDF |
|
38 | Baruch Awerbuch, Amotz Bar-Noy, Madan Gopal |
Approximate distributed Bellman-Ford algorithms. |
IEEE Trans. Commun. |
1994 |
DBLP DOI BibTeX RDF |
|
38 | Baruch Awerbuch, Amotz Bar-Noy, Madan Gopal |
Approximate Distributed Bellman-Ford Algorithms. |
INFOCOM |
1991 |
DBLP DOI BibTeX RDF |
|
38 | Ramsey W. Haddad, Alejandro A. Schäffer |
Recognizing Bellman-Ford-Orderable Graphs. |
SIAM J. Discret. Math. |
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. |
PODC |
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. |
IEEE/ACM Trans. Netw. |
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. |
Efficient Algorithms |
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. |
FAW |
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. |
IEEE Trans. Wirel. Commun. |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Waseem Ahmed Kamal, Raza Samar |
A mission planning approach for UAV applications. |
CDC |
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. |
SECON |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Petar Djukic, Shahrokh Valaee |
Quality-of-Service Provisioning for Multi-service TDMA Mesh Networks. |
ITC |
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. |
IEEE Congress on Evolutionary Computation |
2007 |
DBLP DOI BibTeX RDF |
|
26 | K. Subramani 0001, Kamesh Madduri |
Accomplishing Approximate FCFS Fairness Without Queues. |
HiPC |
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. |
ICN |
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. |
ICCCN |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Yu Wang, Lemin Li, Du Xu |
A Multi-constrained Quality of Service Routing Based on Metrics Transform. |
ICNSC |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Deqiang Chen, Martin Haenggi, J. Nicholas Laneman |
Distributed Spectrum-Efficient Routing Algorithms in Wireless Networks. |
CISS |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Sung-Soo Kim, Seung B. Ahn |
Adaptive Routing Algorithm Using Evolution Program for Multiple Shortest Paths in DRGS. |
ICHIT |
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. |
ICIC (1) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Jean-Michel Hélary, Alessia Milani |
About the Efficiency of Partial Replication to Implement Distributed Shared Memory. |
ICPP |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea |
The SAT-based Approach to Separation Logic. |
J. Autom. Reason. |
2005 |
DBLP DOI BibTeX RDF |
SAT-based decision procedures, separation logic |
26 | Piotr Sankowski |
Shortest Paths in Matrix Multiplication Time. |
ESA |
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. |
PerCom |
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. |
ISCC |
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. |
ICPADS (2) |
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. |
ICME |
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. |
International Conference on Computational Science (1) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Basabi Chakraborty |
GA-Based Multiple Route Selection for Car Navigation. |
AACC |
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. |
PDCAT |
2004 |
DBLP DOI BibTeX RDF |
|
26 | Debasish Chakraborty, Goutam Chakraborty, Norio Shiratori |
A dynamic multicast routing satisfying multiple QoS constraints. |
Int. J. Netw. Manag. |
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. |
DSN |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Jens Gerlach, Joachim Kneis |
Generic Programming for Scientific Computing in C++, Java, and C#. |
APPT |
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. |
International Conference on Computational Science |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Xin Yuan 0001 |
Heuristic algorithms for multiconstrained quality-of-service routing. |
IEEE/ACM Trans. Netw. |
2002 |
DBLP DOI BibTeX RDF |
quality of service, routing |
26 | Roch Guérin, Ariel Orda |
Computing shortest paths for any number of hops. |
IEEE/ACM Trans. Netw. |
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. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
26 | Chao-Ju Hou |
Routing Virtual Circuits with Temporal QoS Requirements in Virtual Path-Based ATM Networks. |
IEEE Trans. Computers |
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. |
ESA |
1998 |
DBLP DOI BibTeX RDF |
|
26 | J. J. Garcia-Luna-Aceves, Marcelo Spohn |
Scalable Link-State Internet Routing. |
ICNP |
1998 |
DBLP DOI BibTeX RDF |
|
26 | Chotipat Pornavalai, Goutam Chakraborty, Norio Shiratori |
QoS based routing algorithm in integrated services packet networks. |
ICNP |
1997 |
DBLP DOI BibTeX RDF |
|
26 | Stavros G. Kolliopoulos, Clifford Stein 0001 |
Finding Real-Valued Single-Source Shortest Paths. |
IPCO |
1996 |
DBLP DOI BibTeX RDF |
|
26 | Jochen Behrens, J. J. Garcia-Luna-Aceves |
Distributed, Scalable Routing Based on Link-State Vectors. |
SIGCOMM |
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. |
SIGMETRICS |
1992 |
DBLP DOI BibTeX RDF |
ARPANET |
Displaying result #1 - #96 of 96 (100 per page; Change: )
|
|