z-logo
open-access-imgOpen Access
Entropy Maximization Problem in Network using Dijkstra’s-Floyd Warshall Algorithm
Author(s) -
Pawan Kumar
Publication year - 2019
Publication title -
international journal of computer applications
Language(s) - Uncategorized
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/ijca2019918341
Subject(s) - computer science , dijkstra's algorithm , floyd–warshall algorithm , maximization , algorithm , operations research , theoretical computer science , mathematical optimization , shortest path problem , mathematics , graph

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom