4403 search results - page 220 / 881 » Galois Theory of Algorithms |
192
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
184
click to vote
ICFCA
2004
Springer
15 years 12 months ago
2004
Springer
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...
195
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
158
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— Trust management, broadly intended as the ability to maintain belief relationship among entities, is recognized as a fundamental security challenge for autonomous and selforgan...
159
click to vote
SIAMAM
2002
15 years 6 months ago
2002
The theory of periodic wavelet transforms presented here was originally developed to deal with the problem of epileptic seizure prediction. A central theorem in the theory is the c...