131 search results - page 18 / 27 » Crossing Number and Weighted Crossing Number of Near-Planar ... |
ICTAI
2010
IEEE
13 years 4 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...
BMCBI
2010
13 years 6 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...
GD
1998
Springer
13 years 11 months ago
1998
Springer
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
CORR
2008
Springer
13 years 6 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...
JGT
2006
13 years 6 months ago
2006
We begin the study of distinguishing geometric graphs. Let G be a geometric graph. An automorphism of the underlying graph that preserves both crossings and noncrossings is called...