Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Kathrin Hanauer"'
Publikováno v:
ACM Journal of Experimental Algorithmics. 27:1-27
One of the most fundamental problems in computer science is the reachability problem : Given a directed graph and two vertices s and t , can s reach t via a path? We revisit existing techniques and combine them with new approaches to support a large
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db627a1cb6c7885ff2774ce1d277596f
https://doi.org/10.1145/3556540
https://doi.org/10.1145/3556540
Autor:
Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Christopher Auer, Daniel Neuwirth, Christian Bachmaier, Josef Reislhuber
Publikováno v:
Algorithmica. 83:3534-3535
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47e6399877971ec9e3c736fc2ea2d5e6
https://doi.org/10.1007/s00453-021-00874-z
https://doi.org/10.1007/s00453-021-00874-z
Given a directed graph and a source vertex, the fully dynamic single-source reachability problem is to maintain the set of vertices that are reachable from the given vertex, subject to edge deletions and insertions. It is one of the most fundamental
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d664961db0cee389a275cc1bffa1a4e
https://doi.org/10.1137/1.9781611976007.9
https://doi.org/10.1137/1.9781611976007.9
Autor:
Josef Reislhuber, Christian Bachmaier, Kathrin Hanauer, Franz J. Brandenburg, Andreas Gleiβner, Christopher Auer, Daniel Neuwirth
Publikováno v:
Algorithmica. 74:1293-1320
A graph is outer 1-planar (o1p) if it can be drawn in the plane such that all vertices are in the outer face and each edge is crossed at most once. o1p graphs generalize outerplanar graphs, which can be recognized in linear time, and specialize 1-pla
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1548d442ff97d99d6b728366091f5985
https://doi.org/10.1007/s00453-015-0002-1
https://doi.org/10.1007/s00453-015-0002-1
Autor:
Christian Bachmaier, Kathrin Hanauer, Christopher Auer, Franz J. Brandenburg, Andreas Gleißner
Publikováno v:
Theoretical Computer Science. 571:36-49
We consider upward planar drawings of directed graphs in the plane (UP), and on standing (SUP) and rolling cylinders (RUP). In the plane and on the standing cylinder the edge curves are monotonically increasing in y-direction. On the rolling cylinder
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::238651377dde60af1d491668ace73a4d
https://doi.org/10.1016/j.tcs.2015.01.003
https://doi.org/10.1016/j.tcs.2015.01.003
Autor:
Christian Bachmaier, Daniel Neuwirth, Kathrin Hanauer, Josef Reislhuber, Franz J. Brandenburg
A graph is NIC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share at most one common end vertex. NIC-planarity generalizes IC-planarity, which allows a vertex to be incident t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7cee46f39487d73e6f9a9ecbdc2194f8
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783642450426
WG
WG
The Feedback problem is one of the classical \(\mathcal{NP}\)-hard problems. Given a graph with n vertices and m arcs, it asks for a subset of arcs whose deletion makes a graph acyclic. An equivalent is the Linear Ordering, where the vertices are ord
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::866bf94b565eb128216ac8a8db2021c0
https://doi.org/10.1007/978-3-642-45043-3_26
https://doi.org/10.1007/978-3-642-45043-3_26
Publikováno v:
Graph Drawing ISBN: 9783642367625
Graph Drawing
Graph Drawing
A simple undirected graph G = (V, E) is k-planar if it can be drawn in the plane such that each edge is crossed at most k times, incident edges do not cross, and a pair of edges must not cross twice. Such graphs have attracted many graph drawers, see
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d006872c5c69bda87cf3d14c245ac6f
https://doi.org/10.1007/978-3-642-36763-2_50
https://doi.org/10.1007/978-3-642-36763-2_50
Publikováno v:
Graph Drawing ISBN: 9783319038407
Graph Drawing
Graph Drawing
A graph layout describes the processing of a graph G by a data structure $\mathcal{D}$ , and the graph is called a $\mathcal{D}$ -graph. The vertices of G are totally ordered in a linear layout and the edges are stored and organized in $\mathcal{D}$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd473fb9d12a677379a6c6d5d6ce438e
https://doi.org/10.1007/978-3-319-03841-4_3
https://doi.org/10.1007/978-3-319-03841-4_3
Publikováno v:
Graph Drawing ISBN: 9783642367625
Graph Drawing
Graph Drawing
We show that planarity testing can be interpreted as a train switching problem. Train switching problems have been studied in the context of permutation networks, i. e., permuting the cars of a train on a given railroad network [5]. The cars enter th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::714ad16e3be39cc78b8a43d4402f4cba
https://doi.org/10.1007/978-3-642-36763-2_51
https://doi.org/10.1007/978-3-642-36763-2_51