Results 41 to 50 of about 3,875,937 (262)

Graph Treewidth and Geometric Thickness Parameters

open access: yes, 2005
Consider a drawing of a graph $G$ in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of $G$, is the classical graph parameter "thickness".
C.S..J.A. Nash-Williams   +13 more
core   +4 more sources

Design issues in the production of hyper‐books and visual‐books [PDF]

open access: yes, 1993
This paper describes an ongoing research project in the area of electronic books. After a brief overview of the state of the art in this field, two new forms of electronic book are presented: hyper‐books and visual‐books.
Catenazzi, Nadia   +2 more
core   +3 more sources

Variasi Koefisien Kekasaran Manning (n) pada Flume Akrilic pada Variasi Kemiringan Saluran dan Debit Aliran

open access: yesMedia Komunikasi Teknik Sipil, 2015
Based on the book of open channels hydraulics by Ven T. Chow (1988) mentioned that the big problems in application Manning equation is determine of roughness coefficien n, because there is no certain way to choose value of n.
Haryono Putro, Joetata Hadihardaja
doaj   +1 more source

Experimental Evaluation of Book Drawing Algorithms

open access: yes, 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   +2 more
core   +2 more sources

Prefabricated foot orthoses compared to a placebo intervention for the treatment of chronic nonspecific low back pain: a study protocol for a randomised controlled trial

open access: yesJournal of Foot and Ankle Research, 2018
Background Prefabricated foot orthoses are used to treat chronic nonspecific low back pain, however their effectiveness and potential mechanism of action is unclear. The primary aims of the study are to investigate the effectiveness of prefabricated foot
Sean Sadler   +3 more
doaj   +1 more source

Stack and Queue Layouts via Layered Separators

open access: yes, 2016
It is known that every proper minor-closed class of graphs has bounded stack-number (a.k.a. book thickness and page number). While this includes notable graph families such as planar graphs and graphs of bounded genus, many other graph families are not ...
ED Demaine   +15 more
core   +1 more source

An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization [PDF]

open access: yes, 2018
Book embedding is one of the most well-known graph drawing models and is extensively studied in the literature. The special case where the number of pages is one is of particular interest: an embedding in this case has a natural circular representation ...
Kobayashi, Yasuaki   +2 more
core   +1 more source

Mixed Linear Layouts of Planar Graphs

open access: yes, 2017
A $k$-stack (respectively, $k$-queue) layout of a graph consists of a total order of the vertices, and a partition of the edges into $k$ sets of non-crossing (non-nested) edges with respect to the vertex ordering. In 1992, Heath and Rosenberg conjectured
C Bachmaier   +12 more
core   +1 more source

Halide‐Dependent Photoluminescence and Heavy‐Atom Effects in Low‐Melting Organic–Inorganic Manganese Halides

open access: yesAdvanced Functional Materials, EarlyView.
Two pyridinium‐based ionic liquid templated hybrid manganese halides, (C4Py)2[MnCl4] and (C4Py)2[MnBr4], display similar bulk structures but show significantly different photoluminescence behaviors due to the bromine heavy‐atom effect. Their stable local Mn environments remain intact even in the molten state, allowing applications such as luminescence ...
Biswajit Bhattacharyya   +22 more
wiley   +1 more source

Layout of Graphs with Bounded Tree-Width

open access: yes, 2004
A \emph{queue layout} of a graph consists of a total order of the vertices, and a partition of the edges into \emph{queues}, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its \emph{queue-
Albertson Michael   +10 more
core   +2 more sources

Home - About - Disclaimer - Privacy