On 2-strong connectivity orientations of mixed graphs and related problems
L Georgiadis, D Kefallinos, E Kosinas - International Workshop on …, 2023 - Springer
Given a mixed graph G, we consider the problem of computing the maximal sets of vertices
C 1, C 2,…, C k with the property that by removing any edge e from G, there is an orientation …
C 1, C 2,…, C k with the property that by removing any edge e from G, there is an orientation …
Maximal Distortion of Geodesic Diameters
A Dumitrescu¹, CD Tóth - … , IWOCA 2023, Tainan, Taiwan, June 7 …, 2023 - books.google.com
For a polygon P with holes in the plane, we denote by º (P) the ratio between the geodesic
and the Euclidean diameters of P. It is shown that over all convex polygons with h convex …
and the Euclidean diameters of P. It is shown that over all convex polygons with h convex …
Improved bounds for the oriented radius of mixed multigraphs
Abstract A mixed multigraph GG is an ordered pair G=(V, E) G=(V,E) with VV a set of
vertices, EE a multiset of unordered and ordered pairs of vertices, respectively, called …
vertices, EE a multiset of unordered and ordered pairs of vertices, respectively, called …
On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems
D Kefallinos, E Kosinas, L Georgiadis - Available at SSRN 4821442 - papers.ssrn.com
A mixed graph $ G $ is a graph that consists of both undirected and directed edges. An
orientation of $ G $ is formed by orienting all the undirected edges of $ G $, ie, converting …
orientation of $ G $ is formed by orienting all the undirected edges of $ G $, ie, converting …