On the public citation graph

Strongly connected orientations of mixed multigraphs

0 signed · 67 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.1007/bfb0121098openalex-snapshot
A linear programming approach to the optimum network orientation problem
inferredcites →https://doi.org/10.1016/0095-8956(78)90078-3openalex-snapshot
Distances in orientations of graphs
inferredcites →https://doi.org/10.1080/00029890.1980.11995131openalex-snapshot
Robbins's Theorem for Mixed Multigraphs
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0203006openalex-snapshot
Finding Dominators in Directed Graphs
inferredcites →https://doi.org/10.2307/2303897openalex-snapshot
A Theorem on Graphs, with an Application to a Problem of Traffic Control

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4821442openalex-extracted
On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems
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.22941openalex-snapshot
Improved bounds for the oriented radius of mixed multigraphs
inferred← citeshttps://doi.org/10.1002/jgt.70009openalex-snapshot
A Note on Improved Bounds for the Oriented Radius of Mixed Multigraphs
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.3230190205openalex-snapshot
Connected reorientations of mixed multigraphs
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-030-50026-9_8openalex-snapshot
An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter
inferred← citeshttps://doi.org/10.1007/978-3-031-34347-6_18openalex-snapshot
On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_1openalex-snapshot
On the Upward Planarity of Mixed Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-08001-7_3openalex-snapshot
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_2openalex-snapshot
On the Most Imbalanced Orientation of a Graph
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-11266-9_49openalex-snapshot
Unilateral Orientation of Mixed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-20036-6_39openalex-snapshot
Optimally Orienting Physical Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-21458-5_35openalex-snapshot
Approximation Algorithms for Orienting Mixed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-32278-5_1openalex-snapshot
Basic Graph Theory
inferred← citeshttps://doi.org/10.1007/s00224-014-9565-5openalex-snapshot
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation
inferred← citeshttps://doi.org/10.1007/s00373-025-02959-wopenalex-snapshot
Diameter Three Orientability of Mixed Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s003730200036openalex-snapshot
Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs
inferred← citeshttps://doi.org/10.1007/s00453-017-0399-9openalex-snapshot
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity
inferred← citeshttps://doi.org/10.1007/s10878-017-0117-1openalex-snapshot
On the most imbalanced orientation of a graph
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.dam.2008.05.017openalex-snapshot
On a relation between the domination number and a strongly connected bidirection of an undirected graph
inferred← citeshttps://doi.org/10.1016/j.dam.2021.08.021openalex-snapshot
An improvement to Chvátal and Thomassen’s upper bound for oriented diameter
inferred← citeshttps://doi.org/10.1016/j.disc.2005.04.012openalex-snapshot
On optimal orientation of cycle vertex multiplications
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113846openalex-snapshot
Large girth and small oriented diameter graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114406openalex-snapshot
On the oriented diameter of near planar triangulations
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114509openalex-snapshot
The oriented diameter of a bridgeless graph with the given path P
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114732openalex-snapshot
Diameter two orientability of mixed graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115163openalex-snapshot
The oriented diameter of mixed multigraphs with diameter 2
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.03.003openalex-snapshot
Diameter of orientations of graphs with given minimum degree
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/j.endm.2018.01.019openalex-snapshot
Methods for solving road network problems with disruptions
inferred← citeshttps://doi.org/10.1016/j.ifacol.2016.07.812openalex-snapshot
A bi-objective model to address disruptions on unidirectional road networks**This project is funded by the Beijing YuanZhi Tiancheng Technology Co. Ltd, China.
inferred← citeshttps://doi.org/10.1016/j.ins.2005.09.001openalex-snapshot
The edge-orientation problem and some of its variants on weighted graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.03.044openalex-snapshot
Approximation algorithms for orienting mixed graphs
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(01)00298-0openalex-snapshot
Orientations of digraphs almost preserving diameter
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(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.1089/cmb.2011.0163openalex-snapshot
Optimally Orienting Physical Networks
inferred← citeshttps://doi.org/10.1093/comjnl/bxl068openalex-snapshot
Edge-Orienting on Split, Planar and Treelike Graphs
inferred← citeshttps://doi.org/10.1111/itor.12641openalex-snapshot
Model and methods to address urban road network problems with disruptions
inferred← citeshttps://doi.org/10.1111/itor.13229openalex-snapshot
The strong network orientation problem
inferred← citeshttps://doi.org/10.1137/0216041openalex-snapshot
Optimal Mixed Graph Augmentation
inferred← citeshttps://doi.org/10.1137/0401022openalex-snapshot
On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
inferred← citeshttps://doi.org/10.1137/0406003openalex-snapshot
On the Structure of the Strong Orientations of a Graph
inferred← citeshttps://doi.org/10.1137/15m1018885openalex-snapshot
Graphs with Many Strong Orientations
inferred← citeshttps://doi.org/10.1142/s0129054107004644openalex-snapshot
GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
inferred← citeshttps://doi.org/10.46298/dmtcs.567openalex-snapshot
Bounds for the minimum oriented diameter
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/2637openalex-snapshot
Orientation and layout problems on graphs, with applications
inferred← citeshttps://doi.org/10.70675/3a23c593z275fz4900z84a4zab173e29103fopenalex-snapshot
Urban Transportation Road Network Problems : Models, Methods and Application
inferred← citeshttps://doi.org/10.70675/6cfdfdabzdcc8z4393z93ceza47fc3a0185bopenalex-snapshot
Output-sensitive algorithms for enumeration problems in 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.