2,673 research outputs found
Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time
Thomassen characterized some 1-plane embedding as the forbidden configuration
such that a given 1-plane embedding of a graph is drawable in straight-lines if
and only if it does not contain the configuration [C. Thomassen, Rectilinear
drawings of graphs, J. Graph Theory, 10(3), 335-341, 1988].
In this paper, we characterize some 1-plane embedding as the forbidden
configuration such that a given 1-plane embedding of a graph can be re-embedded
into a straight-line drawable 1-plane embedding of the same graph if and only
if it does not contain the configuration. Re-embedding of a 1-plane embedding
preserves the same set of pairs of crossing edges.
We give a linear-time algorithm for finding a straight-line drawable 1-plane
re-embedding or the forbidden configuration.Comment: Appears in the Proceedings of the 24th International Symposium on
Graph Drawing and Network Visualization (GD 2016). This is an extended
abstract. For a full version of this paper, see Hong S-H, Nagamochi H.:
Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time,
Technical Report TR 2016-002, Department of Applied Mathematics and Physics,
Kyoto University (2016
Environment-dependent plasticity and ontogenetic changes in the brain of hatchery-reared Atlantic salmon
Non-Convex Representations of Graphs
We show that every plane graph admits a planar straight-line drawing in which all faces with more than three vertices are non-convex polygon
Reduced rearing density increases postrelease migration success of Atlantic salmon (Salmo salar) smolts
Convex drawings of graphs with non-convex boundary
Abstract. In this paper, we study a new problem of finding a convex drawing of graphs with a non-convex boundary. It is proved that every triconnected plane graph whose boundary is fixed with a star-shaped polygon admits a drawing in which every inner facial cycle is drawn as a convex polygon. Such a drawing, called an inner-convex drawing, can be obtained in linear time.
Plasmas and Controlled Nuclear Fusion
Contains reports on two research projects.U. S. Atomic Energy Commission (Contract AT(11-1)-3070
Lager ureumgehalte door scherp voeren
Om te weten of een sterk milieugerichte bedrijfsvoering gevolgen heeft voor de diergezondheid en vruchtbaarheid worden deze aspecten op Koeien & Kansen bedrijven onderzocht. Bij een sterk milieugerichte bedrijfsvoering is het ureumgehalte in de tankmelk een belangrijke graadmeter. Uit onderstaand onderzoek blijkt dat de ureumgehaltes in de tankmelk van K&K-bedrijven lager zijn dan op referentiebedrijven, wat betekent dat ze inderdaad met meer aandacht voor het milieu werken
Contact Representations of Graphs in 3D
We study contact representations of graphs in which vertices are represented
by axis-aligned polyhedra in 3D and edges are realized by non-zero area common
boundaries between corresponding polyhedra. We show that for every 3-connected
planar graph, there exists a simultaneous representation of the graph and its
dual with 3D boxes. We give a linear-time algorithm for constructing such a
representation. This result extends the existing primal-dual contact
representations of planar graphs in 2D using circles and triangles. While
contact graphs in 2D directly correspond to planar graphs, we next study
representations of non-planar graphs in 3D. In particular we consider
representations of optimal 1-planar graphs. A graph is 1-planar if there exists
a drawing in the plane where each edge is crossed at most once, and an optimal
n-vertex 1-planar graph has the maximum (4n - 8) number of edges. We describe a
linear-time algorithm for representing optimal 1-planar graphs without
separating 4-cycles with 3D boxes. However, not every optimal 1-planar graph
admits a representation with boxes. Hence, we consider contact representations
with the next simplest axis-aligned 3D object, L-shaped polyhedra. We provide a
quadratic-time algorithm for representing optimal 1-planar graph with L-shaped
polyhedra
Normale veevervanging en hoge gezondheidskosten op high-techbedrijf
Vergelijking van de veevervanging op het high-techbedrijf in de jaren 1999 - 2001 met het gemiddelde van de proefbedrijven over 1992-1999 laat een normale veevervanging zien op het high-techbedrijf
From paradox to pattern shift: Conceptualising liminal hotspots and their affective dynamics
This article introduces the concept of liminal hotspots as a specifically psychosocial and sociopsychological type of wicked problem, best addressed in a process-theoretical framework. A liminal hotspot is defined as an occasion characterised by the experience of being trapped in the interstitial dimension between different forms-of-process. The paper has two main aims. First, to articulate a nexus of concepts associated with liminal hotspots that together provide general analytic purchase on a wide range of problems concerning “troubled” becoming. Second, to provide concrete illustrations through examples drawn from the health domain. In the conclusion, we briefly indicate the sense in which liminal hotspots are part of broader and deeper historical processes associated with changing modes for the management and navigation of liminality
- …