article

Free access

Algorithm 141: Path matrix

Author:

P. Z. IngermanAuthors Info & Claims

Communications of the ACM, Volume 5, Issue 11

Page 556

https://doi.org/10.1145/368996.369016

Published: 01 November 1962 Publication History

PDF eReader

Cited By

View all

Arfer K(2024)Artiruno: A free‐software tool for multi‐criteria decision‐making with verbal decision analysisJournal of Multi-Criteria Decision Analysis10.1002/mcda.182731:1-2Online publication date: 2-Apr-2024
https://doi.org/10.1002/mcda.1827
Gryzun LShcherbakov OBida B(2023)Development of the information system for navigation in modern university campusCTE Workshop Proceedings10.55056/cte.56610(380-398)Online publication date: 21-Mar-2023
https://doi.org/10.55056/cte.566
Zhu DFan SZeng XXi RHou M(2023)Graph-Attention-Network-Based Cost Estimation Model in Materialized View Environment2023 IEEE 29th International Conference on Parallel and Distributed Systems (ICPADS)10.1109/ICPADS60453.2023.00198(1388-1396)Online publication date: 17-Dec-2023
https://doi.org/10.1109/ICPADS60453.2023.00198
Show More Cited By

Algorithm 141: Path matrix
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages

Recommendations

Path norms on a matrix
Abstract
We define row path norm and column path norm of a matrix and relate path norms with other standard matrix norms. A row (resp. column) path norm gives a path that maximizes relative row (resp. column) distances starting from the first row (resp. ...
A label-setting algorithm for finding a quickest path

The quickest path problem is to find a path to send a given amount of data from the source to the destination with minimum transmission time. To find the quickest path, existing algorithms enumerate nondominated paths with distinct capacity, and then ...
A Multiple Pairs Shortest Path Algorithm

The multiple pairs shortest path problem (MPSP) arises in many applications where the shortest paths and distances between only some specific pairs of origin-destination (OD) nodes in a network are desired. The traditional repeated single-source shortest ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 5, Issue 11

Nov. 1962

178 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/368996

Editor:
C. C. Gotlieb
Univ. of Toronto, Toronto, Canada

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1962

Published in CACM Volume 5, Issue 11

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
1,024
Total Downloads

Downloads (Last 12 months)95
Downloads (Last 6 weeks)16

Reflects downloads up to 29 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Arfer K(2024)Artiruno: A free‐software tool for multi‐criteria decision‐making with verbal decision analysisJournal of Multi-Criteria Decision Analysis10.1002/mcda.182731:1-2Online publication date: 2-Apr-2024
https://doi.org/10.1002/mcda.1827
Gryzun LShcherbakov OBida B(2023)Development of the information system for navigation in modern university campusCTE Workshop Proceedings10.55056/cte.56610(380-398)Online publication date: 21-Mar-2023
https://doi.org/10.55056/cte.566
Zhu DFan SZeng XXi RHou M(2023)Graph-Attention-Network-Based Cost Estimation Model in Materialized View Environment2023 IEEE 29th International Conference on Parallel and Distributed Systems (ICPADS)10.1109/ICPADS60453.2023.00198(1388-1396)Online publication date: 17-Dec-2023
https://doi.org/10.1109/ICPADS60453.2023.00198
Kole AHillmich SDatta KWille RSengupta I(2020)Improved Mapping of Quantum Circuits to IBM QX ArchitecturesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2019.296275339:10(2375-2383)Online publication date: Oct-2020
https://doi.org/10.1109/TCAD.2019.2962753
Brown GCarlyle W(2019)Solving the Nearly Symmetric All-Pairs Shortest-Path ProblemINFORMS Journal on Computing10.1287/ijoc.2018.0873Online publication date: 1-Nov-2019
https://doi.org/10.1287/ijoc.2018.0873
Jatana NSuri BKumar P(2018)Mutation Testing-Based Test Suite Reduction Inspired from Warshall’s AlgorithmSoftware Engineering10.1007/978-981-10-8848-3_33(357-364)Online publication date: 13-Jun-2018
https://doi.org/10.1007/978-981-10-8848-3_33
Xue KWang J(2018)Identifying Influential Spreaders by Temporal Efficiency Centrality in Temporal NetworkCloud Computing and Security10.1007/978-3-030-00018-9_33(369-383)Online publication date: 26-Sep-2018
https://doi.org/10.1007/978-3-030-00018-9_33
Cena FLikavec SOsborne F(2013)Anisotropic propagation of user interests in ontology-based user modelsInformation Sciences10.1016/j.ins.2013.07.006250(40-60)Online publication date: Nov-2013
https://doi.org/10.1016/j.ins.2013.07.006
(1973)ReferencesSparse Matrices10.1016/S0076-5392(08)60535-4(141-151)Online publication date: 1973
https://doi.org/10.1016/S0076-5392(08)60535-4
(1971)BibliographyData Structures10.1016/B978-0-12-093550-5.50019-6(415-429)Online publication date: 1971
https://doi.org/10.1016/B978-0-12-093550-5.50019-6

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Path norms on a matrix

A label-setting algorithm for finding a quickest path

A Multiple Pairs Shortest Path Algorithm

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations