169 search results - page 4 / 34 » On Graph Crossing Number and Edge Planarization |
143
Voted
CORR
2008
Springer
15 years 13 days 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...
105
Voted
GC
2007
Springer
15 years 9 days ago
2007
Springer
A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with n vertices and m ...
GD
2006
Springer
15 years 4 months ago
2006
Springer
IJFCS
2006
15 years 10 days ago
2006
108
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...