메뉴 건너뛰기




Volumn 3984 LNCS, Issue , 2006, Pages 158-164

Feedback vertex sets in rotator graphs

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; FEEDBACK; INTERCONNECTION NETWORKS; SET THEORY; TOPOLOGY;

EID: 33745942306     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11751649_17     Document Type: Conference Paper
Times cited : (6)

References (13)
  • 1
    • 0026927433 scopus 로고
    • Rotator graphs: An efficient topology for point-to-point multiprocessor networks
    • Peter F. Corbett, Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks, IEEE Transactions on Parallel and Distributed System, Vol. 3, No. 5. (1995) 622-626
    • (1995) IEEE Transactions on Parallel and Distributed System , vol.3 , Issue.5 , pp. 622-626
    • Corbett, P.F.1
  • 2
    • 0027841693 scopus 로고
    • DBCube: A new class of hierarchical multiprocessor interconnection networks with area efficient layout
    • C. Chen, D.P. Agrawal and J.r. Burke, dBCube: A New Class of Hierarchical Multiprocessor Interconnection Networks with Area Efficient Layout, IEEE Trans. on Parallel and Distributed Systems, Vol. 4. (1993) 1332-1344
    • (1993) IEEE Trans. on Parallel and Distributed Systems , vol.4 , pp. 1332-1344
    • Chen, C.1    Agrawal, D.P.2    Burke, J.R.3
  • 3
    • 0037105931 scopus 로고    scopus 로고
    • New bounds on the size of the feedback vertex set on meshes and butterflies
    • Caragiannis, C. Kaklamanis, P. Kanellopoulos: New Bounds on The Size of The Feedback Vertex Set on Meshes and Butterflies, Information Processing Letters, Vol. 83, No. 5, (2002) 275-280
    • (2002) Information Processing Letters , vol.83 , Issue.5 , pp. 275-280
    • Caragiannis, C.K.1    Kanellopoulos, P.2
  • 4
    • 84986947112 scopus 로고
    • Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem
    • M.M. Flood: Exact and Heuristic Algorithms for The Weighted Feedback Arc Set Problem: A special case of the skew-symmetric quadratic assignment problem, Networks, Vol. 20. (1990) 1-23
    • (1990) Networks , vol.20 , pp. 1-23
    • Flood, M.M.1
  • 8
    • 0013188149 scopus 로고
    • Node-deletion problem on bipartite graphs
    • M. Yannakakis, Node-Deletion Problem on Bipartite Graphs, SIAM Journal on Computing, Vol. 10. (1981) 310-327
    • (1981) SIAM Journal on Computing , vol.10 , pp. 310-327
    • Yannakakis, M.1
  • 9
    • 0032049851 scopus 로고    scopus 로고
    • Exact minimum feedback vertex set in meshes and butterflies
    • F.L. Luccio: Exact Minimum Feedback Vertex Set in Meshes and Butterflies, Information Processing Letters, Vol. 66, No. 2. (1998) 59-64
    • (1998) Information Processing Letters , vol.66 , Issue.2 , pp. 59-64
    • Luccio, F.L.1
  • 10
    • 0037105931 scopus 로고    scopus 로고
    • New bounds on the size of the feedback vertex set on meshes and butterflies
    • I. Caragiannis, C. Kaklamanis, P. Kanellopoulos: New Bounds on The Size of The Feedback Vertex Set on Meshes and Butterflies, Information Processing Letters, Vol. 83, No. 5. (2002) 275-280
    • (2002) Information Processing Letters , vol.83 , Issue.5 , pp. 275-280
    • Caragiannis, I.1    Kaklamanis, C.2    Kanellopoulos, P.3
  • 13
    • 13744265861 scopus 로고    scopus 로고
    • Minimum feedback vertex sets in shuffle-based interconnection networks
    • R. Kralovic, P. Ruzicka: Minimum Feedback Vertex Sets in Shuffle-based Interconnection Networks, Information Processing Letters, Vol. 86, No. 4. (2003) 191-196
    • (2003) Information Processing Letters , vol.86 , Issue.4 , pp. 191-196
    • Kralovic, R.1    Ruzicka, P.2


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