Upward book embeddings of st-graphs
We study $ k $-page upward book embeddings ($ k $ UBEs) of $ st $-graphs, that is, book
embeddings of single-source single-sink directed acyclic graphs on $ k $ pages with the …
embeddings of single-source single-sink directed acyclic graphs on $ k $ pages with the …
[HTML][HTML] Extending upward planar graph drawings
In this paper we study the computational complexity of the Upward Planarity Extension
problem, which takes as input an upward planar drawing Γ H of a subgraph H of a directed …
problem, which takes as input an upward planar drawing Γ H of a subgraph H of a directed …
Quasi-upward planar drawings with minimum curve complexity
This paper studies the problem of computing quasi-upward planar drawings of bimodal
plane digraphs with minimum curve complexity, ie, drawings such that the maximum number …
plane digraphs with minimum curve complexity, ie, drawings such that the maximum number …
[图书][B] 10 reasons to get interested in graph drawing
This is an invitation to the research area of graph drawing. It encompasses basic research
such as graph theory, complexity theory, data structures, and graph algorithms as well as …
such as graph theory, complexity theory, data structures, and graph algorithms as well as …
Upward Book Embeddability of st-Graphs: Complexity and Algorithms
A k-page upward book embedding (k UBE) of a directed acyclic graph G is a book
embeddings of G on k pages with the additional requirement that the vertices appear in a …
embeddings of G on k pages with the additional requirement that the vertices appear in a …
Coloring mixed and directional interval graphs
A has a set of vertices, a set of undirected edges, and a set of directed arcs. A of a mixed
graph G is a function c that assigns to each vertex in G a positive integer such that, for each …
graph G is a function c that assigns to each vertex in G a positive integer such that, for each …
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 …
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 …
st-Orientations with Few Transitive Edges
The problem of orienting the edges of an undirected graph such that the resulting digraph is
acyclic and has a single source s and a single sink t has a long tradition in graph theory and …
acyclic and has a single source s and a single sink t has a long tradition in graph theory and …
Check for updates Coloring Mixed and Directional Interval Graphs
G Gutowski¹, F Mittelstädt, I Rutter… - Graph Drawing and …, 2023 - books.google.com
A mixed graph has a set of vertices, a set of undirected edges, and a set of directed arcs. A
proper coloring of a mixed graph G is a function c that assigns to each vertex in G a positive …
proper coloring of a mixed graph G is a function c that assigns to each vertex in G a positive …