144 search results - page 3 / 29 » Algorithms for the Hypergraph and the Minor Crossing Number ... |
APVIS
2008
13 years 6 months ago
2008
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossin...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...
ICALP
2001
Springer
13 years 10 months ago
2001
Springer
In this paper we initiate the study of testing properties of hypergraphs. The goal of property testing is to distinguish between the case whether a given object has a certain prope...
GD
2008
Springer
13 years 6 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...