1933 search results - page 48 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
CASES
2010
ACM
13 years 6 months ago
2010
ACM
The performance of most embedded systems is critically dependent on the memory hierarchy performance. In particular, higher cache hit rate can provide significant performance boos...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X â...
COMPGEOM
2001
ACM
14 years 12 days ago
2001
ACM
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
VTC
2010
IEEE
13 years 7 months ago
2010
IEEE
—This paper exploits the use of location information of wireless terminals to improve the performance of a beamforming system and support multiple access. Based on a system provi...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...