Results 31 to 40 of about 424,972 (258)

Experimental Evaluation of Book Drawing Algorithms

, 2017
A $k$-page book drawing of a graph $G=(V,E)$ consists of a linear ordering of its vertices along a spine and an assignment of each edge to one of the $k$ pages, which are half-planes bounded by the spine. In a book drawing, two edges cross if and only if
Klawitter, Jonathan, Mchedlidze, Tamara, Nöllenburg, Martin   +2 more
core   +2 more sources

On the pseudolinear crossing number [PDF]

, 2014
A drawing of a graph is {\em pseudolinear} if there is a pseudoline arrangement such that each pseudoline contains exactly one edge of the drawing. The {\em pseudolinear crossing number} of a graph $G$ is the minimum number of pairwise crossings of edges
Hernandez-Velez, Cesar, Leanos, Jesus, Salazar, Gelasio   +2 more
core   +1 more source

Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends

, 2018
We study the following classes of beyond-planar graphs: 1-planar, IC-planar, and NIC-planar graphs. These are the graphs that admit a 1-planar, IC-planar, and NIC-planar drawing, respectively.
C Bachmaier, D Harel, FJ Brandenburg, G Liotta, G Ringel, H Fraysseix de, H Purchase, JE Hopcroft, M Chrobak, MA Bekos, P Eades, SG Kobourov, W Didimo, W Huang   +13 more
core   +1 more source

Bold graph drawings

Computational Geometry, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

A Java software for drawing graphs [PDF]

Network Biology, 2012
In this study the software for drawing graphs, which is run as a Java application, was described. It can be freely downloaded and run on Windows platforms. The software can be used to draw directed, undirected, cyclic and acyclic graphs.
WenJun Zhang
doaj  

Recognizing and Drawing IC-planar Graphs

, 2015
IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs.
C Auer, C Auer, C Binucci, C Thomassen, D Král, E Ackerman, E Giacomo Di, E Giacomo Di, E Giacomo Di, EN Argyriou, FJ Brandenburg, H Fraysseix de, J Fox, J Pach, M Chrobak, MA Bekos, MJ Alam, MR Garey, O Cheong, OV Borodin, P Eades, S Hong, S-H Hong, VP Korzhik, W Didimo, W Didimo, X Zhang, X Zhang   +27 more
core   +1 more source

On the minimum size of maximal IC-plane graphs

AIMS Mathematics
A graph is IC-planar if it admits a drawing with at most one crossing per edge so that each vertex is incident to at most one crossing edge, and an IC-plane graph means such a drawing of an IC-planar graph.
Rui Xu
doaj   +1 more source

Time after time – circadian clocks through the lens of oscillator theory

FEBS Letters, EarlyView.
Oscillator theory bridges physics and circadian biology. Damped oscillators require external drivers, while limit cycles emerge from delayed feedback and nonlinearities. Coupling enables tissue‐level coherence, and entrainment aligns internal clocks with environmental cues.
Marta del Olmo, Carolin Ector, Hanspeter Herzel   +2 more
wiley   +1 more source

The Widths of Strict Outerconfluent Graphs [PDF]

Discrete Mathematics & Theoretical Computer Science
Strict outerconfluent drawing is a style of graph drawing in which vertices are drawn on the boundary of a disk, adjacencies are indicated by the existence of smooth curves through a system of tracks within the disk, and no two adjacent vertices are ...
David Eppstein
doaj   +1 more source

ALTERNATIVE PROOF ON THE CROSSING NUMBER OF K1,1,3,N [PDF]

Acta Electrotechnica et Informatica, 2019
The main aim of the paper is to give the crossing number of join product G+Dn for the connected graph G of order five isomorphic with the complete tripartite graph K1,1,3, where Dn consists on n isolated vertices.
Michal STAS
doaj   +1 more source