A Theorem on Graphs, with an Application to a Problem of Traffic Control

1939/05/01 by Herbert Robbins, H. E. Robbins · 8 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Artificial intelligence #Computer science #Control (management) #Graph Theory and Algorithms #Graph theory and applications #Mathematics

paper · doi:10.2307/2303897

crossref issued 1939/05/01 · crossref published 1939/05/01 · crossref published-print 1939/05/01 · openalex publication_date 1939/05/01 · crossref created 2006/04/23 · crossref deposited 2018/02/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/03 · crossref indexed 2026/08/05

Cited by

• Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
• Path-based depth-first search for strong and biconnected components
• On the optimal strongly connected orientations of city street graphs. II: Two east‐west avenues or North—South Streets
• On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets
• On the optimal strongly connected orientations of city street graphs IV: Four east-west avenues or north-south streets
• On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
• Strong orientation [wikipedia]
• Strongly connected component [wikipedia]