Results 41 to 50 of about 17,820 (243)
An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization [PDF]
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
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
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
Design issues in the production of hyper‐books and visual‐books [PDF]
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
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
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
Layout of Graphs with Bounded Tree-Width
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
This review explores functional and responsive materials for triboelectric nanogenerators (TENGs) in sustainable smart agriculture. It examines how particulate contamination and dirt affect charge transfer and efficiency. Environmental challenges and strategies to enhance durability and responsiveness are outlined, including active functional layers ...
Rafael R. A. Silva +9 more
wiley +1 more source
On Optimal 2- and 3-Planar Graphs [PDF]
A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized, this has not ...
Bekos, Michael A. +2 more
core +2 more sources
Ti6Al4V‐Bioglass‐Copper Composites for Load‐Bearing Implants
We have designed and manufactured a novel Ti64‐based composite by adding 45S5 bioglass (BG) and copper (Cu). Adding BG on titanium improves wear resistance and biocompatibility, whereas Cu addition improves mechanical strength while providing inherent lifelong bacterial resistance.
Lochan Upadhayay +3 more
wiley +1 more source

