1970/03/01 by Paul Purdom, Paul W. Purdom · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Algorithms and Data Compression #Binary logarithm #Closure (psychology) #Combinatorics #Complexity and Algorithms in Graphs #Dijkstra's algorithm #Directed graph #Discrete mathematics #Floyd–Warshall algorithm #Graph #Line graph #Mathematics #Shortest path problem #Time complexity #Transitive closure #Transitive reduction #Transitive relation #Undirected graph #Voltage graph
paper · doi:10.1007/bf01940892
crossref issued 1970/03/01 · crossref published 1970/03/01 · crossref published-print 1970/03/01 · openalex publication_date 1970/03/01 · crossref created 2005/07/31 · crossref deposited 2020/02/17 · openalex created_date 2025/10/10 · crossref indexed 2025/10/25 · openalex updated_date 2026/07/29