23 search results - page 2 / 5 » Finding Hamilton Circuit in a Graph |
ICES
2003
Springer
14 years 17 days ago
2003
Springer
A review is given of approaches to growing neural networks and electronic circuits. A new method for growing graphs and circuits using a developmental process is discussed. The met...
INFOCOM
1997
IEEE
13 years 11 months ago
1997
IEEE
Due to the increasing reliance of our society on the timely and reliable transfer of large quantities of information (suchas voice, data, and video)across high speed communication...
DATE
2006
IEEE
13 years 11 months ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
COMPGEOM
2010
ACM
14 years 13 days ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
ESA
2004
Springer
14 years 22 days ago
2004
Springer
The computation of dominators in a flowgraph has applications in several areas, including program optimization, circuit testing, and theoretical biology. Lengauer and Tarjan [30]...