6740 search results - page 245 / 1348 » An s -Hamiltonian Line Graph Problem |
116
Voted
ENTCS
2008
15 years 23 days ago
2008
Several recent research efforts have focused on the dynamic aspects of software architectures providing suitable models and techniques for handling the run-time modification of th...
167
click to vote
ICALP
1995
Springer
15 years 4 months ago
1995
Springer
The problem to determine whether a given k-colored graph is a subgraph of a properly colored interval graph has an application in DNA physical mapping. In this paper, we study the...
PKDD
2009
Springer
15 years 7 months ago
2009
Springer
Probabilistic logics have attracted a great deal of attention during the past few years. While logical languages have taken a central position in research on knowledge representati...
163
Voted
OOPSLA
2000
Springer
15 years 4 months ago
2000
Springer
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
102
click to vote
JEI
2006
15 years 20 days ago
2006
To prevent large error accumulation in multiple image registration considering real-time applications, we propose a new fast global mosaic method using sequential block matching in...