2283 search results - page 207 / 457 » Bounds of Graph Characteristics |
MST
2011
12 years 11 months ago
2011
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
Consider an acyclic directed network G with sources S1, S2, . . . , Sl and distinct sinks R1, R2, . . . , Rl. For i = 1, 2, . . . , l, let ci denote the min-cut between Si and Ri....
CSE
2009
IEEE
14 years 3 months ago
2009
IEEE
—Location-based Social Networks (LSNs) allow users to see where their friends are, to search location-tagged content within their social graph, and to meet others nearby. The rec...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
Hardware accelerators are increasingly used to extend the computational capabilities of baseline scalar processors to meet the growing performance and power requirements of embedd...