1172 search results - page 163 / 235 » Path Algorithms on Regular Graphs |
144
click to vote
SODA
1992
ACM
15 years 3 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
135
Voted
CIKM
2011
Springer
14 years 2 months ago
2011
Springer
Extracting information from web pages is an important problem; it has several applications such as providing improved search results and construction of databases to serve user qu...
118
click to vote
ESOP
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and retu...
121
click to vote
MCU
2004
15 years 3 months ago
2004
We propose linear time solutions to two much celebrated NP-complete problems, namely the 3CNF-SAT and the directed Hamiltonian Path Problem (HPP), based on AHNEPs having all resour...
121
click to vote
SAC
2008
ACM
15 years 1 months ago
2008
ACM
Test case prioritization for regression testing can be performed using different metrics (e.g., statement coverage, path coverage) depending on the application context. Employing ...