[HTML][HTML] Upward and quasi-upward planarity testing of embedded mixed graphs
Mixed graphs have both directed and undirected edges and have received considerable
attention in the literature. We study two upward planarity testing problems for embedded …
attention in the literature. We study two upward planarity testing problems for embedded …
Computing k-modal embeddings of planar digraphs
Given a planar digraph $ G $ and a positive even integer $ k $, an embedding of $ G $ in the
plane is k-modal, if every vertex of $ G $ is incident to at most $ k $ pairs of consecutive …
plane is k-modal, if every vertex of $ G $ is incident to at most $ k $ pairs of consecutive …
Computing quasi-upward planar drawings of mixed graphs
A mixed graph has both directed and undirected edges. We study how to compute a
crossing-free drawing of an embedded planar mixed graph, such that it is upward 'as much …
crossing-free drawing of an embedded planar mixed graph, such that it is upward 'as much …
A visualization framework and user studies for overloaded orthogonal drawings
W Didimo, EM Kornaropoulos… - Computer Graphics …, 2018 - Wiley Online Library
Overloaded orthogonal drawing (OOD) is a recent graph visualization style specifically
conceived for directed graphs. It merges the advantages of some popular drawing …
conceived for directed graphs. It merges the advantages of some popular drawing …
[HTML][HTML] 1-bend upward planar slope number of SP-digraphs
It is proved that every series-parallel digraph whose maximum vertex degree is Δ admits an
upward planar drawing with at most one bend per edge such that each edge segment has …
upward planar drawing with at most one bend per edge such that each edge segment has …
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem
A vertex of a plane digraph is bimodal if all its incoming edges (and hence all its outgoing
edges) are consecutive in the cyclic order around it. A plane digraph is bimodal if all its …
edges) are consecutive in the cyclic order around it. A plane digraph is bimodal if all its …
Intrinsic linking in directed graphs
JS Foisy, HN Howards, NR Rich - 2015 - projecteuclid.org
We extend the notion of intrinsic linking to directed graphs. We give methods of constructing
intrinsically linked directed graphs, as well as complicated directed graphs that are not …
intrinsically linked directed graphs, as well as complicated directed graphs that are not …
Upward planarity testing of embedded mixed graphs
LNCS 7034 - Upward Planarity Testing of Embedded Mixed Graphs Page 1 Upward Planarity
Testing of Embedded Mixed Graphs * Carla Binucci and Walter Didimo Dip. Ing. Elettronica e …
Testing of Embedded Mixed Graphs * Carla Binucci and Walter Didimo Dip. Ing. Elettronica e …
1-bend upward planar drawings of SP-digraphs
It is proved that every series-parallel digraph whose maximum vertex-degree is\varDelta
admits an upward planar drawing with at most one bend per edge such that each edge …
admits an upward planar drawing with at most one bend per edge such that each edge …
Quasi-upward planar drawings of mixed graphs with few bends: heuristics and exact methods
A mixed graph has both directed and undirected edges. We study how to compute a
crossing-free drawing of a planar embedded mixed graph, such that it is upward “as much …
crossing-free drawing of a planar embedded mixed graph, such that it is upward “as much …