42 search results - page 7 / 9 » A New Algorithm for the Hypergraph Transversal Problem |
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
JGAA
2006
13 years 7 months ago
2006
Visualization of circuits is an important research area in electronic design automation. One commonly accepted method to visualize a circuit aligns the gates to layers and uses or...
AMC
2010
13 years 7 months ago
2010
Let X be a smooth quadric of dimension 2m in P2m+1 C and let Y, Z X be subvarieties both of dimension m which intersect transversely. In this paper we give an algorithm for comput...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
WEA
2010
Springer
14 years 17 days ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...