Sciweavers

983 search results - page 7 / 197
» Negative-Weight Cycle Algorithms
Sort
View
EURODAC
1995
IEEE
164views VHDL» more  EURODAC 1995»
14 years 3 days ago
Bottleneck removal algorithm for dynamic compaction and test cycles reduction
: We present a new, dynamic algorithm for test sequence compaction and test cycle reduction for combinationaland sequential circuits. Several dynamic algorithms for compaction in c...
Srimat T. Chakradhar, Anand Raghunathan
CSR
2010
Springer
13 years 12 months ago
A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem
Abstract. The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been ...
Gerold Jäger, Weixiong Zhang
JACM
2007
115views more  JACM 2007»
13 years 8 months ago
Optimal pants decompositions and shortest homotopic cycles on an orientable surface
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
Éric Colin de Verdière, Francis Laza...
GECCO
2003
Springer
124views Optimization» more  GECCO 2003»
14 years 1 months ago
Study Diploid System by a Hamiltonian Cycle Problem Algorithm
Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of intro...
Dong Xianghui, Ruwei Dai
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
14 years 22 days ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran