Sciweavers

3757 search results - page 549 / 752
» The overlap number of a graph
Sort
View
CORR
2004
Springer
121views Education» more  CORR 2004»
15 years 6 months ago
Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners
We consider linear systems arising from the use of the finite element method for solving a certain class of linear elliptic problems. Our main result is that these linear systems, ...
Erik G. Boman, Bruce Hendrickson, Stephen A. Vavas...
COMBINATORICS
2000
124views more  COMBINATORICS 2000»
15 years 6 months ago
Colouring Planar Mixed Hypergraphs
A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...
André Kündgen, Eric Mendelsohn, Vitaly...
JCO
1998
136views more  JCO 1998»
15 years 6 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
TC
1998
15 years 6 months ago
Optimal Zero-Aliasing Space Compaction of Test Responses
—Many built-in self-testing (BIST) schemes compress the test responses from a k-output circuit to q signature streams, where q << k, a process termed space compaction. The ...
Krishnendu Chakrabarty, Brian T. Murray, John P. H...
NETWORKS
2007
15 years 6 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu