6740 search results - page 238 / 1348 » An s -Hamiltonian Line Graph Problem |
126
Voted
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
126
Voted
TIP
1998
15 years 3 months ago
1998
—Extracting a signature from a check with patterned background is a thorny problem in image segmentation. Methods based on threshold techniques often necessitate meticulous postp...
126
Voted
FGCS
2000
15 years 3 months ago
2000
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...
124
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...
115
Voted
WER
2007
Springer
15 years 9 months ago
2007
Springer
Complex information systems have numerous design variables that are systematically decided upon during the design process. In high-variability systems, some of these decisions are...