136 search results - page 18 / 28 » Crossing and Weighted Crossing Number of Near-Planar Graphs |
139
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an i...
102
click to vote
ICTAI
2010
IEEE
14 years 9 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
EJC
2010
14 years 11 months ago
2010
A classical result of Euler states that the tangent numbers are an alternating sum of Eulerian numbers. A dual result of Roselle states that the secant numbers can be obtained by a...
101
Voted
COMGEO
2011
ACM
14 years 6 months ago
2011
ACM
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
BMCBI
2010
14 years 11 months ago
2010
Background: All polypeptide backbones have the potential to form amyloid fibrils, which are associated with a number of degenerative disorders. However, the likelihood that amyloi...