1963 search results - page 178 / 393 » The Maximum Solution Problem on Graphs |
118
Voted
TCAD
2008
15 years 2 months ago
2008
State encoding is one of the most difficult problems in the synthesis of asynchronous controllers. This paper presents a method that can solve the problem of large controllers spec...
135
Voted
ESOP
2006
Springer
15 years 6 months ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
121
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
SWAT
1990
Springer
15 years 6 months ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
139
Voted
COMPGEOM
2005
ACM
15 years 4 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...