Results 231 to 240 of about 424,972 (258)
Exploring the Underlying Mechanisms of Reduced Elasticity in PA6/PA66 Bicomponent Melt-Spun Fibers: An Investigation of Viscoelastic Properties and Simulation Analysis. [PDF]
Polymers (Basel)Abbas A +5 more
europepmc +1 more source
Surface Topography-Based Classification of Coefficient of Friction in Strip-Drawing Test Using Kohonen Self-Organising Maps. [PDF]
Materials (Basel)Szwajka K +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
IEEE Transactions on Software Engineering, 1995
A diagram is a drawing on the plane that represents a graph like structure, where nodes are represented by symbols and edges are represented by curves connecting pairs of symbols. An automatic layout facility is a tool that receives as input a graph like structure and is able to produce a diagram that nicely represents such a structure.
P. Bertolazzi +2 more
openaire +3 more sources
A diagram is a drawing on the plane that represents a graph like structure, where nodes are represented by symbols and edges are represented by curves connecting pairs of symbols. An automatic layout facility is a tool that receives as input a graph like structure and is able to produce a diagram that nicely represents such a structure.
P. Bertolazzi +2 more
openaire +3 more sources
2017
This chapter considers the concept of planar graph and its underlying theory. It begins with a discussion of the Three Houses and Three Utilities Problem and how it can be represented by a graph. It shows that solving the Three Houses and Three Utilities Problem is equivalent to the problem of determining whether the graph that represents it can be ...
Arthur Benjamin +2 more
openaire +1 more source
This chapter considers the concept of planar graph and its underlying theory. It begins with a discussion of the Three Houses and Three Utilities Problem and how it can be represented by a graph. It shows that solving the Three Houses and Three Utilities Problem is equivalent to the problem of determining whether the graph that represents it can be ...
Arthur Benjamin +2 more
openaire +1 more source
2009
Invited Talks.- Networks in Biology - From Identification, Analysis to Interpretation.- Graph Drawing for Security Visualization.- Papers.- Succinct Greedy Graph Drawing in the Hyperbolic Plane.- An Algorithm to Construct Greedy Drawings of Triangulations.- Crossing and Weighted Crossing Number of Near-Planar Graphs.- Cubic Graphs Have Bounded Slope ...
openaire +2 more sources
Invited Talks.- Networks in Biology - From Identification, Analysis to Interpretation.- Graph Drawing for Security Visualization.- Papers.- Succinct Greedy Graph Drawing in the Hyperbolic Plane.- An Algorithm to Construct Greedy Drawings of Triangulations.- Crossing and Weighted Crossing Number of Near-Planar Graphs.- Cubic Graphs Have Bounded Slope ...
openaire +2 more sources
SIAM Journal on Discrete Mathematics, 1994
Suppose that we have a 2-cell embedding of a graph \(G\) in an orientable surface \(S_ g\) of genus \(g\). The surface can be represented by the standard fundamental polygon that is a convex \((4g)\)-gon in the plane with its sides pairwise identified as \(a_ 1 b_ 1 a^ -_ 1 b^ - _ 1\cdots a_ g b_ g a^ -_ g b^ -_ g\).
openaire +1 more source
Suppose that we have a 2-cell embedding of a graph \(G\) in an orientable surface \(S_ g\) of genus \(g\). The surface can be represented by the standard fundamental polygon that is a convex \((4g)\)-gon in the plane with its sides pairwise identified as \(a_ 1 b_ 1 a^ -_ 1 b^ - _ 1\cdots a_ g b_ g a^ -_ g b^ -_ g\).
openaire +1 more source