Sciweavers

1933 search results - page 109 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
128
Voted
ISAAC
2004
Springer
103views Algorithms» more  ISAAC 2004»
15 years 9 months ago
Structural Similarity in Graphs (A Relaxation Approach for Role Assignment)
Standard methods for role assignment partition the vertex set of a graph in such a way that vertices in the same class can be considered to have equivalent roles in the graph. Seve...
Ulrik Brandes, Jürgen Lerner
161
Voted
ISSAC
1997
Springer
194views Mathematics» more  ISSAC 1997»
15 years 7 months ago
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
Qiang Li, Yike Guo, Tetsuo Ida, John Darlington
STOC
1992
ACM
122views Algorithms» more  STOC 1992»
15 years 7 months ago
Existence and Construction of Edge Disjoint Paths on Expander Graphs
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
Andrei Z. Broder, Alan M. Frieze, Eli Upfal
140
Voted
IEEEPACT
2009
IEEE
15 years 10 months ago
Using Aggressor Thread Information to Improve Shared Cache Management for CMPs
—Shared cache allocation policies play an important role in determining CMP performance. The simplest policy, LRU, allocates cache implicitly as a consequence of its replacement ...
Wanli Liu, Donald Yeung
130
Voted
TACAS
2000
Springer
121views Algorithms» more  TACAS 2000»
15 years 7 months ago
Using Static Analysis to Improve Automatic Test Generation
Conformance testing is still the main industrial validation technique for telecommunication protocols. The automatic construction of test cases based on the model approach is hinde...
Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu