539 search results - page 47 / 108 » An Improved Upper Bound for SAT |
WAOA
2007
Springer
14 years 1 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
MFCS
1993
Springer
13 years 11 months ago
1993
Springer
We prove (for fixed k) that at least 1 k−1 (n 2 ) − O(n) equality tests and no more than 2 k (n 2 )+O(n) equality tests are needed in the worst case to determine whether a giv...
FSTTCS
2000
Springer
13 years 11 months ago
2000
Springer
We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves th...
CCCG
2007
13 years 9 months ago
2007
Given a convex polyhedron with n vertices and F faces, what is the fewest number of pieces, each of which unfolds to a simple polygon, into which it may be cut by slices along edg...
IANDC
2010
13 years 6 months ago
2010
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...