On the public citation graph

On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids

0 signed · 41 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230150409openalex-snapshot
Strongly connected orientations of mixed multigraphs
inferredcites →https://doi.org/10.1002/net.3230190204openalex-snapshot
On the optimal strongly connected orientations of city street graphs. II: Two east‐west avenues or North—South Streets
inferredcites →https://doi.org/10.1016/0095-8956(78)90078-3openalex-snapshot
Distances in orientations of graphs
inferredcites →https://doi.org/10.1016/0166-218x(94)90217-8openalex-snapshot
On the optimal strongly connected orientations of city street graphs IV: Four east-west avenues or north-south streets
inferredcites →https://doi.org/10.1080/00029890.1980.11995131openalex-snapshot
Robbins's Theorem for Mixed Multigraphs
inferredcites →https://doi.org/10.1137/1.9781611970401openalex-snapshot
Graph Theory and Its Applications to Problems of Society
inferredcites →https://doi.org/10.2307/2303897openalex-snapshot
A Theorem on Graphs, with an Application to a Problem of Traffic Control
inferredcites →https://doi.org/10.2307/2322080openalex-snapshot
Discrete Mathematical Models with Applications to Social, Biological, and Environmental Problems.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199901)33:1<57::aid-net4>3.0.co;2-ropenalex-snapshot
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
inferred← citeshttps://doi.org/10.1002/jgt.10160openalex-snapshot
Complexity of approximating the oriented diameter of chordal graphs
inferred← citeshttps://doi.org/10.1002/jgt.22181openalex-snapshot
Oriented diameter of graphs with given maximum degree
inferred← citeshttps://doi.org/10.1002/jgt.v45:4openalex-snapshot
inferred← citeshttps://doi.org/10.1002/net.3230190204openalex-snapshot
On the optimal strongly connected orientations of city street graphs. II: Two east‐west avenues or North—South Streets
inferred← citeshttps://doi.org/10.1002/net.3230220202openalex-snapshot
On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets
inferred← citeshttps://doi.org/10.1007/3-540-36379-3_19openalex-snapshot
The Complexity of Approximating the Oriented Diameter of Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-20796-9_14openalex-snapshot
Bounds for the Oriented Diameter of Planar Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_7openalex-snapshot
Directing Road Networks by Listing Strong Orientations
inferred← citeshttps://doi.org/10.1007/978-3-642-32278-5_1openalex-snapshot
Basic Graph Theory
inferred← citeshttps://doi.org/10.1007/s003730200036openalex-snapshot
Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs
inferred← citeshttps://doi.org/10.1007/s10100-011-0189-4openalex-snapshot
Bi-objective bimodal urban road network design using hybrid metaheuristics
inferred← citeshttps://doi.org/10.1007/s10878-024-01177-zopenalex-snapshot
On the oriented diameter of planar triangulations
inferred← citeshttps://doi.org/10.1007/s11067-011-9163-xopenalex-snapshot
Hybrid Evolutionary Metaheuristics for Concurrent Multi-Objective Design of Urban Road and Public Transit Networks
inferred← citeshttps://doi.org/10.1007/s12190-021-01498-wopenalex-snapshot
A proof of a conjecture on maximum Wiener index of oriented ladder graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90180-5openalex-snapshot
Methods and problems of communication in usual networks
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90217-8openalex-snapshot
On the optimal strongly connected orientations of city street graphs IV: Four east-west avenues or north-south streets
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2011.07.005openalex-snapshot
Optimizing reserve capacity of urban road networks in a discrete Network Design Problem
inferred← citeshttps://doi.org/10.1016/j.ejc.2016.08.006openalex-snapshot
Improved bound on the oriented diameter of graphs with given minimum degree
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00038-7openalex-snapshot
On optimal orientations of cartesian products of graphs (I)
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00136-3openalex-snapshot
On optimal orientations of cartesian products of graphs (ii): complete graphs and even cycles
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00373-8openalex-snapshot
On optimal orientations of G vertex-multiplications
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00298-1openalex-snapshot
Algorithms for graphs with small octopus
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00376-7openalex-snapshot
AT-free graphs: linear bounds for the oriented diameter
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00017-6openalex-snapshot
Optimal orientations of products of paths and cycles
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00110-9openalex-snapshot
On optimal orientations of cartesian products with a bipartite graph
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70373-xopenalex-snapshot
New Directions in Graph Theory (With an Emphasis on the Role of Applications)
inferred← citeshttps://doi.org/10.1023/a:1022471626622openalex-snapshot
Interpolation theorem for a continuous function on orientations of a simple graph
inferred← citeshttps://doi.org/10.1111/itor.13229openalex-snapshot
The strong network orientation problem
inferred← citeshttps://doi.org/10.1137/0406003openalex-snapshot
On the Structure of the Strong Orientations of a Graph
inferred← citeshttps://doi.org/10.1142/s0219265900000032openalex-snapshot
OPTIMAL ORIENTATIONS OF ANNULAR NETWORKS
inferred← citeshttps://doi.org/10.26493/2590-9770.1246.99copenalex-snapshot
Optimal orientations of strong products of paths
inferred← citeshttps://doi.org/10.2989/16073606.2020.1754958openalex-snapshot
The diameter of strong orientations of strong products of graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.