2413 search results - page 41 / 483 » Understanding the problem |
SIAMAM
2008
14 years 11 months ago
2008
We want to give a systematic presentation of voltage or current intensity excitation for time-harmonic eddy-current problems. The key point of our approach resides in a suitable p...
110
click to vote
ACID
2006
15 years 15 days ago
2006
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
ESA
2008
Springer
15 years 26 days ago
2008
Springer
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
SWAT
1994
Springer
15 years 3 months ago
1994
Springer
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
76
Voted
MFCS
1992
Springer
15 years 3 months ago
1992
Springer
In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging op...