메뉴 건너뛰기




Volumn 86, Issue 4, 2003, Pages 191-196

Minimum feedback vertex sets in shuffle-based interconnection networks

Author keywords

Combinatorial problems; De Bruijn; Feedback vertex set; Kautz; Shuffle exchange

Indexed keywords

ALGORITHMS; GRAPH THEORY; POLYNOMIALS; SET THEORY;

EID: 13744265861     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00504-5     Document Type: Article
Times cited : (21)

References (14)
  • 1
    • 0000113012 scopus 로고    scopus 로고
    • A 2 -approximation algorithm for the undirected feedback vertex set problem
    • Bafna V., Berman P., Fujito T. A 2 -approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math. 12:1999;289-297.
    • (1999) SIAM J. Discrete Math. , vol.12 , pp. 289-297
    • Bafna, V.1    Berman, P.2    Fujito, T.3
  • 4
    • 0001621179 scopus 로고    scopus 로고
    • Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference
    • Bar-Yehuda R., Geiger D., Naor J.S., Roth R.M. Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference. SIAM J. Comput. 27:1998;942-959.
    • (1998) SIAM J. Comput. , vol.27 , pp. 942-959
    • Bar-Yehuda, R.1    Geiger, D.2    Naor, J.S.3    Roth, R.M.4
  • 5
    • 0005371554 scopus 로고    scopus 로고
    • New bounds on the size of the minimum feedback vertex set in meshes and butterflies
    • SIROCCO 2001, Ottawa, ON: Carleton Scientific
    • Caragiannis I., Kaklamanis Ch., Kanellopoulos P. New bounds on the size of the minimum feedback vertex set in meshes and butterflies. Proceedings in Informatics 11, SIROCCO 2001. 2001;77-88 Carleton Scientific, Ottawa, ON.
    • (2001) Proceedings in Informatics , vol.11 , pp. 77-88
    • Caragiannis, I.1    Kaklamanis, Ch.2    Kanellopoulos, P.3
  • 9
    • 0028548641 scopus 로고
    • On the feedback vertex set in permutation graphs
    • Liang Y.D. On the feedback vertex set in permutation graphs. Inform. Process. Lett. 52:1994;123-129.
    • (1994) Inform. Process. Lett. , vol.52 , pp. 123-129
    • Liang, Y.D.1
  • 10
    • 0031295212 scopus 로고    scopus 로고
    • Minimum feedback vertex set in cocomparability graphs and convex bipartite graphs
    • Liang Y.D., Chang M.S. Minimum feedback vertex set in cocomparability graphs and convex bipartite graphs. Acta Inform. 34:1997;337-346.
    • (1997) Acta Inform. , vol.34 , pp. 337-346
    • Liang, Y.D.1    Chang, M.S.2
  • 11
    • 0000402987 scopus 로고    scopus 로고
    • A linear-time algorithm for the weighted feedback vertex problem on interval graphs
    • Lu C.L., Tang C.Y. A linear-time algorithm for the weighted feedback vertex problem on interval graphs. Inform. Process. Lett. 61:1997;107-112.
    • (1997) Inform. Process. Lett. , vol.61 , pp. 107-112
    • Lu, C.L.1    Tang, C.Y.2
  • 12
    • 0032049851 scopus 로고    scopus 로고
    • Almost exact minimum feedback vertex set in meshes and butterflies
    • Luccio F.L. Almost exact minimum feedback vertex set in meshes and butterflies. Inform. Process. Lett. 66:1998;59-64.
    • (1998) Inform. Process. Lett. , vol.66 , pp. 59-64
    • Luccio, F.L.1
  • 14
    • 0022046230 scopus 로고
    • Feedback vertex sets and cyclically reducible graphs
    • Wang C.-C., Lloyd E.L., Soffa M.L. Feedback vertex sets and cyclically reducible graphs. J. ACM. 32:1985;296-313.
    • (1985) J. ACM , vol.32 , pp. 296-313
    • Wang, C.-C.1    Lloyd, E.L.2    Soffa, M.L.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.