-
1
-
-
0001621179
-
Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference
-
Bar-Yehuda R., Geiger D., Naor J.S., and Roth R.M. Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference. SIAM J. Comput. 27 4 (1998) 942-959
-
(1998)
SIAM J. Comput.
, vol.27
, Issue.4
, pp. 942-959
-
-
Bar-Yehuda, R.1
Geiger, D.2
Naor, J.S.3
Roth, R.M.4
-
2
-
-
0037105931
-
New bounds on the size of the feedback vertex set on meshes and butterflies
-
Caragiannis I., Kaklamanis C., and Kanellopoulos P. New bounds on the size of the feedback vertex set on meshes and butterflies. Inform. Process. Lett. 83 5 (2002) 275-280
-
(2002)
Inform. Process. Lett.
, vol.83
, Issue.5
, pp. 275-280
-
-
Caragiannis, I.1
Kaklamanis, C.2
Kanellopoulos, P.3
-
3
-
-
0026927433
-
Rotator graphs: An efficient topology for point-to-point multiprocessor networks
-
Corbett P.F. Rotator graphs: An efficient topology for point-to-point multiprocessor networks. IEEE Trans. Parallel Distrib. Syst. 3 5 (1992) 622-626
-
(1992)
IEEE Trans. Parallel Distrib. Syst.
, vol.3
, Issue.5
, pp. 622-626
-
-
Corbett, P.F.1
-
4
-
-
84986947112
-
Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem
-
Flood M.M. Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem. Networks 20 (1990) 1-23
-
(1990)
Networks
, vol.20
, pp. 1-23
-
-
Flood, M.M.1
-
7
-
-
0024019017
-
A graph theoretic approach to statistical data security
-
Gusfield D. A graph theoretic approach to statistical data security. SIAM J. Comput. 17 3 (1998) 552-571
-
(1998)
SIAM J. Comput.
, vol.17
, Issue.3
, pp. 552-571
-
-
Gusfield, D.1
-
9
-
-
0016349356
-
Approximation algorithms for combinatorial problems
-
Johnson D.S. Approximation algorithms for combinatorial problems. J. Comput. System Sci. 9 (1974) 256-278
-
(1974)
J. Comput. System Sci.
, vol.9
, pp. 256-278
-
-
Johnson, D.S.1
-
10
-
-
13744265861
-
Minimum feedback vertex sets in shuffle-based interconnection networks
-
Kralovic R., and Ruzicka P. Minimum feedback vertex sets in shuffle-based interconnection networks. Inform. Process. Lett. 86 4 (2003) 191-196
-
(2003)
Inform. Process. Lett.
, vol.86
, Issue.4
, pp. 191-196
-
-
Kralovic, R.1
Ruzicka, P.2
-
11
-
-
0032049851
-
Exact minimum feedback vertex set in meshes and butterflies
-
Luccio F.L. Exact minimum feedback vertex set in meshes and butterflies. Inform. Process. Lett. 66 2 (1998) 59-64
-
(1998)
Inform. Process. Lett.
, vol.66
, Issue.2
, pp. 59-64
-
-
Luccio, F.L.1
-
12
-
-
0004233425
-
-
John Wiley and Sons, Inc., New York
-
Silberschatz A., Galvin P.B., and Gagne G. Operating Systems Concepts. 6th ed. (2003), John Wiley and Sons, Inc., New York
-
(2003)
Operating Systems Concepts. 6th ed.
-
-
Silberschatz, A.1
Galvin, P.B.2
Gagne, G.3
-
14
-
-
0013188149
-
Node-deletion problem on bipartite graphs
-
Yannakakis M. Node-deletion problem on bipartite graphs. SIAM J. Comput. 10 (1981) 310-327
-
(1981)
SIAM J. Comput.
, vol.10
, pp. 310-327
-
-
Yannakakis, M.1
|