6740 search results - page 982 / 1348 » An s -Hamiltonian Line Graph Problem |
214
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
196
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
185
click to vote
KDD
1995
ACM
15 years 10 months ago
1995
ACM
One objective of knowledge acquisition using inductive modeling has been the development of correct and effectively computable descriptions that can also be assimilated and used b...
157
click to vote
ASPDAC
2009
ACM
15 years 10 months ago
2009
ACM
—Redundant via insertion is a widely recommended technique to enhance the via yield and reliability. In this paper, the post-routing redundant via insertion problem is transforme...
159
click to vote
AIPS
2008
15 years 9 months ago
2008
We consider a generalization of the PDB homomorphism abstractions to what is called "structural patterns". The bais in abstracting the problem in hand into provably trac...