Results 81 to 90 of about 426,579 (276)

Drawing a Graph in a Hypercube

open access: yes, 2004
A $d$-dimensional hypercube drawing of a graph represents the vertices by distinct points in $\{0,1\}^d$, such that the line-segments representing the edges do not cross.
Wood, David R.
core   +2 more sources

Time‐Dependent Oxidation and Scale Evolution of a Wrought Co/Ni‐Based Superalloy

open access: yesAdvanced Engineering Materials, EarlyView.
This study shows how a new wrought Co/Ni‐based superalloy resists oxidation at 800 ∘$^\circ$C. The oxide scale changes from rough, fast‐growing spinel to a dense, protective chromia–alumina layer. Atom probe analysis reveals tiny refractory‐rich bubbles at the interface that mark the transition to long‐term, diffusion‐controlled protection ...
Cameron Crabb   +6 more
wiley   +1 more source

3D Implementation of SVG

open access: yesGong-kuang zidonghua, 2012
In view of problem of limitation on description and drawing of 3D graph by SVG, the paper proposed a 3D implementing method of SVG. It introduced conversion principle of 2D coordinate to 3D coordinate of SVG in details, gave processes of drawing and ...
WANG Li-li
doaj  

Various heuristic algorithms to minimise the two-page crossing numbers of graphs

open access: yesOpen Computer Science, 2015
We propose several new heuristics for the twopage book crossing problem, which are based on recent algorithms for the corresponding one-page problem. Especially, the neural network model for edge allocation is combined for the first time with various one-
He Hongmei   +3 more
doaj   +1 more source

The Widths of Strict Outerconfluent Graphs [PDF]

open access: yesDiscrete 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

The $\mathbb{Z}_2$-genus of Kuratowski minors

open access: yes, 2019
A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the drawing crosses an even number of times. The $\mathbb{Z}_2$-genus of a graph $G$ is the minimum $g$ such that $G$ has an independently even drawing on the ...
Fulek, Radoslav, Kynčl, Jan
core   +1 more source

Copper Nanocrystallization in Anodic Oxide Films of Ti–Cu‐Based Bulk Metallic Glass and Its Effect on the Corrosion Resistance and Cytocompatibility

open access: yesAdvanced Engineering Materials, EarlyView.
Viktoriia Shtefan, Thorgund Nemec, Ute Hempel, Annett Gebert and coworkers demonstrate that anodic treatment of Ti–Cu‐based metallic glass in a nontoxic pyrophosphate electrolyte forms a protective bilayered Ti/Zr‐oxide film enriched with Cu nanocrystals.
Viktoriia Shtefan   +8 more
wiley   +1 more source

Application of Web Map of Coal Mine Based on SVG

open access: yesGong-kuang zidonghua, 2011
For problem of limitation of expansibility and compatibility of Web map because that application of Web map need use some tool provided by the third party to realize graph drawing, the paper proposed an application scheme of Web map of coal mine based on
WANG Li-li, BAI Xiao-bo
doaj  

3D (Bio) Printing Combined Fiber Fabrication Methods for Tissue Engineering Applications: Possibilities and Limitations

open access: yesAdvanced Functional Materials, EarlyView.
Biofabrication aims at providing innovative technologies and tools for the fabrication of tissue‐like constructs for tissue engineering and regenerative medicine applications. By integrating multiple biofabrication technologies, such as 3D (bio) printing with fiber fabrication methods, it would be more realistic to reconstruct native tissue's ...
Waseem Kitana   +2 more
wiley   +1 more source

GPU-Based Parallel Particle Swarm Optimization Methods for Graph Drawing

open access: yesDiscrete Dynamics in Nature and Society, 2017
Particle Swarm Optimization (PSO) is a population-based stochastic search technique for solving optimization problems, which has been proven to be effective in a wide range of applications. However, the computational efficiency on large-scale problems is
Jianhua Qu   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy