335 search results - page 29 / 67 » Solving the Hamiltonian path problem with a light-based comp... |
139
Voted
CSR
2009
Springer
15 years 10 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
138
Voted
ICCAD
1994
IEEE
15 years 7 months ago
1994
IEEE
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
121
Voted
GD
2007
Springer
15 years 9 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
154
Voted
ISCAPDCS
2003
15 years 4 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
124
click to vote
SEFM
2008
IEEE
15 years 9 months ago
2008
IEEE
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...