226 search results - page 8 / 46 » Lower bounds on the obstacle number of graphs |
153
click to vote
COCO
1997
Springer
15 years 6 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
142
Voted
SODA
2010
ACM
15 years 4 days ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
99
Voted
DM
2010
15 years 1 months ago
2010
For a non-negative integer T, we prove that the independence number of a graph G = (V, E) in which every vertex belongs to at most T triangles is at least uV f(d(u), T) where d(u)...
128
Voted
GD
2008
Springer
15 years 2 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...
114
click to vote
GD
2003
Springer
15 years 7 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...