384 search results - page 51 / 77 » On s-hamiltonian-connected line graphs |
ESA
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we will describe some heuristics that can be used to improve the runtime of a wide range of commonly used algorithms for the negative cycle detection problem signiï¬...
DIAGRAMS
2004
Springer
14 years 2 months ago
2004
Springer
People sometimes appear to build analogical representations in order to reason about graphical information. In this paper we consider the extent to which the tendency to represent ...
DATE
2002
IEEE
14 years 1 months ago
2002
IEEE
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
DM
2002
13 years 8 months ago
2002
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
KBSE
2010
IEEE
13 years 7 months ago
2010
IEEE
We present a semi-automated approach, Secoria, for analyzing a security runtime architecture for security and for conformance to an object-oriented implementation. Typecheckable a...