The Floyd–Warshall algorithm on graphs with negative cycles

Hougardy, Stefan

doi:10.1016/j.ipl.2010.02.001

Cited by 186 publications

(79 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Besides, the possibility of using information fusion techniques is not explicitly defined as a capacity of the architecture. Although significant progress has been made in the development of architectures to manage Information fusion is applied to classification problems or merging the solutions of different systems [22,23]. However, it is not possible to find solutions that allow the semiautomatic creation of workflows of information fusion that would reduce the development time integrating new components.…”

Section: Related Workmentioning

confidence: 99%

Self-Organizing Architecture for Information Fusion in Distributed Sensor Networks

Bajo

Paz

Villarrubia

et al. 2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

The management of heterogeneous distributed sensor networks requires new solutions that can address the problem of automatically fusing the information coming from different sources in an efficient and effective manner. In the literature it is possible to find different types of data fusion and information fusion techniques in use today, but it is still a challenge to obtain systems that allow the automation or semiautomation of information processing and fusion. In this paper, we present a multiagent system that based on the organizational theory proposes a new model to automatically process and fuse information in heterogeneous distributed sensor networks. The proposed architecture is applied to a case study for indoor location where information is taken from different heterogeneous sensors.

show abstract

Section: Related Workmentioning

confidence: 99%

Self-Organizing Architecture for Information Fusion in Distributed Sensor Networks

Bajo

Paz

Villarrubia

et al. 2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…Hougardy's [17] research entitled "The Floyd-Warshall Algorithm on Graph with Negative cycles." This study discusses the Floyd-Warshall algorithm used to calculate the shortest path between all pairs of vertices on the side of a weighted and directed graph.…”

Section: Hougardy's Researchmentioning

confidence: 99%

Prim and Floyd-Warshall Comparative Algorithms in Shortest Path Problem

Ramadhan¹,

Siahaan²,

Mesran³

2018

Proceedings of the Joint Workshop KO2PI and the 1st International Conference on Advance &Amp; Scientific Innovation

View full text Add to dashboard Cite

Optimization is an effort to obtain the best results by considering the constraints, constraints, and limitations that exist on a problem; the goal is to minimize or suppress the things that harm and maximize the things that are considered profitable. Generally, the Floyd-Warsall algorithm is widely used to solve shortest path problems, while the Prim algorithm is often used to solve the MST (Minimum Spanning Tree) problem in the Graph to minimize tree ranges or reduce the number of branches. Comparing the Prim algorithm with the Floyd-Warsall algorithm is expected to add proof if the Prim algorithm is not only used to solve Minimum Spanning Tree problem but can also solve the problem of Shortest Path Problem.

show abstract

“…, N pat . The whole procedure of computing the shortest path by Equation (6) can be considered as the well-known Floyd's algorithm that can acquire the shortest path in a weighted graph [30]. Because Equation (6) …”

Section: Step 2: Dimensionality Reduction Of Patterns By Isomapmentioning

confidence: 99%

Super-Resolution Reconstruction of Remote Sensing Images Using Multiple-Point Statistics and Isometric Mapping

Zhang

2017

Remote Sensing

View full text Add to dashboard Cite

When using coarse-resolution remote sensing images, super-resolution reconstruction is widely desired, and can be realized by reproducing the intrinsic features from a set of coarse-resolution fraction data to fine-resolution remote sensing images that are consistent with the coarse fraction information. Prior models of spatial structures that encode the expected features at the fine (target) resolution are helpful to constrain the spatial patterns of remote sensing images to be generated at that resolution. These prior models can be used properly by multiple-point statistics (MPS), capable of extracting the intrinsic features of patterns from prior models such as training images, and copying them to the simulated regions using hard and soft conditional data, or even without any conditional data. However, because traditional MPS methods based on linear dimensionality reduction are not suitable to deal with nonlinear data, and isometric mapping (ISOMAP) can reduce the dimensionality of nonlinear data effectively, this paper presents a sequential simulation framework for generating super-resolution remote sensing images using ISOMAP and MPS. Using four different examples, it is demonstrated that the structural characteristics of super-resolution reconstruction of remote sensing images using this method, are similar to those of training images.

show abstract

The Floyd–Warshall algorithm on graphs with negative cycles

Cited by 186 publications

References 14 publications

Self-Organizing Architecture for Information Fusion in Distributed Sensor Networks

Self-Organizing Architecture for Information Fusion in Distributed Sensor Networks

Prim and Floyd-Warshall Comparative Algorithms in Shortest Path Problem

Super-Resolution Reconstruction of Remote Sensing Images Using Multiple-Point Statistics and Isometric Mapping

Contact Info

Product

Resources

About