메뉴 건너뛰기




Volumn 40, Issue 1, 2004, Pages 51-62

Minimum cycle bases for network graphs

Author keywords

Electrical network; Graph cycle; Matroid; Minimum cycle basis

Indexed keywords

ALGORITHMS; CIRCUIT THEORY; COMPUTATIONAL METHODS; ELECTRICAL ENGINEERING; MATRIX ALGEBRA; PROBLEM SOLVING; SET THEORY;

EID: 15344339780     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1098-x     Document Type: Article
Times cited : (59)

References (24)
  • 3
    • 0142037690 scopus 로고
    • On finding a cycle basis with a shortest maximal cycle
    • [CGH]
    • [CGH] D.M. Chickering, D. Geiger, and D. Heckerman. On finding a cycle basis with a shortest maximal cycle. Inform. Process. Lett., 54:55-58, 1995.
    • (1995) Inform. Process. Lett. , vol.54 , pp. 55-58
    • Chickering, D.M.1    Geiger, D.2    Heckerman, D.3
  • 5
    • 0003677229 scopus 로고    scopus 로고
    • [Di] Graduate Texts in Mathematics. Springer-Verlag, Berlin, 1997. 2nd Edn.
    • [Di] R. Diestel. Graph Theory, volume 173 of Graduate Texts in Mathematics. Springer-Verlag, Berlin, 1997. 2nd Edn. 2000.
    • (2000) Graph Theory , vol.173
    • Diestel, R.1
  • 7
    • 1842780617 scopus 로고    scopus 로고
    • A polynomial time algorithm to find the minimal cycle basis of a regular matroid
    • [GH] Lecture Notes in Computer Science, Springer-Verlag, Berlin
    • [GH] A. Golynski and J.D. Horton. A polynomial time algorithm to find the minimal cycle basis of a regular matroid. In Algorithm Theory - SWAT 2002, Turku, Finland, volume 2368 of Lecture Notes in Computer Science, pages 551-570. Springer-Verlag, Berlin, 2002.
    • (2002) Algorithm Theory - SWAT 2002, Turku, Finland , vol.2368 , pp. 551-570
    • Golynski, A.1    Horton, J.D.2
  • 8
    • 1842629269 scopus 로고
    • The all-pairs min-cul problem and the min cycle basis problem on planar graphs
    • [HM]
    • [HM] D. Hartvigsen and R. Mardon. The all-pairs min-cul problem and the min cycle basis problem on planar graphs. SIAM J. Discrete Math., 7:403-418, 1994.
    • (1994) SIAM J. Discrete Math. , vol.7 , pp. 403-418
    • Hartvigsen, D.1    Mardon, R.2
  • 9
    • 0023328260 scopus 로고
    • A polynomial-time algorithm to find the shortest cycle basis of a graph
    • [Ho] April
    • [Ho] J.D. Horton. A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM J. Comput., 16:358-366. April 1987.
    • (1987) SIAM J. Comput. , vol.16 , pp. 358-366
    • Horton, J.D.1
  • 11
    • 0942303541 scopus 로고    scopus 로고
    • Combinatorial relaxation algorithm for mixed polynomial matrices
    • [IM]
    • [IM] S. Iwata and K. Murota. Combinatorial relaxation algorithm for mixed polynomial matrices. Math. Programming Ser. A, 90:353-371, 2001.
    • (2001) Math. Programming Ser. a , vol.90 , pp. 353-371
    • Iwata, S.1    Murota, K.2
  • 12
    • 21044454959 scopus 로고
    • On minimal and optimal cycle bases of graphs for sparse flexibility matrices
    • [Ka]
    • [Ka] A. Kaveh. On minimal and optimal cycle bases of graphs for sparse flexibility matrices. Z. Angew. Math. Mech., 69:T212-T214, 1989.
    • (1989) Z. Angew. Math. Mech. , vol.69
    • Kaveh, A.1
  • 13
    • 4944257625 scopus 로고
    • Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Veitheilung galvanischer Ströme geführt wird
    • [Ki]
    • [Ki] G. Kirchhoff. Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Veitheilung galvanischer Ströme geführt wird. Ann, Physik Chem., 72(12):497-508, 1847.
    • (1847) Ann, Physik Chem. , vol.72 , Issue.12 , pp. 497-508
    • Kirchhoff, G.1
  • 14
    • 18944407379 scopus 로고    scopus 로고
    • A case study in periodic timetabling
    • [LM] Electronic Notes in Theoretical Computer Science (ENTS)
    • [LM] C. Liebchen and R. Möhring. A case study in periodic timetabling. In Proceedings of ATMOS 2002, volume 66, No. 6 of Electronic Notes in Theoretical Computer Science (ENTS), 2002.
    • (2002) Proceedings of ATMOS 2002 , vol.66 , Issue.6
    • Liebchen, C.1    Möhring, R.2
  • 15
    • 10044255454 scopus 로고    scopus 로고
    • Minimal cycle basis of outerplanar graphs
    • [LS]
    • [LS] J. Leydold and P. F. Stadler. Minimal cycle basis of outerplanar graphs. Electron. J. Combin., 5:R16, 1998.
    • (1998) Electron. J. Combin , vol.5
    • Leydold, J.1    Stadler, P.F.2
  • 16
    • 0003641563 scopus 로고    scopus 로고
    • [Mu] Algorithms and Combinatorics. Springer-Verlag, Berlin
    • [Mu] K. Murota. Matrices and Matroids for Systems Analysis, volume 20 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 2000.
    • (2000) Matrices and Matroids for Systems Analysis , vol.20
    • Murota, K.1
  • 17
    • 0004061262 scopus 로고
    • [Ox] Oxford Gradutae Texts in Mathematics. Oxford University Press, Oxford
    • [Ox] J.G. Oxley. Matroid Theory. Oxford Gradutae Texts in Mathematics. Oxford University Press, Oxford, 1992.
    • (1992) Matroid Theory
    • Oxley, J.G.1
  • 18
    • 0014567146 scopus 로고
    • An algorithm for finding a fundamental set of cycles of a graph
    • [Pa]
    • [Pa] K. Paton. An algorithm for finding a fundamental set of cycles of a graph. Comm. ACM, 12(9):514-519, 1969.
    • (1969) Comm. ACM , vol.12 , Issue.9 , pp. 514-519
    • Paton, K.1
  • 19
    • 0002045546 scopus 로고
    • [Re] Algorithms and Combinatorics. Springer-Verlag, Berlin
    • [Re] A. Recski. Matroid Theory and its Applications, volume 6 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 1989.
    • (1989) Matroid Theory and Its Applications , vol.6
    • Recski, A.1
  • 20
    • 49149147896 scopus 로고
    • Decomposition of regular matroids
    • [Se]
    • [Se] P. Seymour. Decomposition of regular matroids. J. Combin. Theory Ser. B, 28:305-359, 1980.
    • (1980) J. Combin. Theory Ser. B , vol.28 , pp. 305-359
    • Seymour, P.1
  • 21
    • 0031074284 scopus 로고    scopus 로고
    • On the automation of the force method in the optimal plastic design of frames
    • [Sp]
    • [Sp] K.V. Spiliopoulos. On the automation of the force method in the optimal plastic design of frames. Comput. Methods Appl. Mech. Engrg., 141:141-156, 1997.
    • (1997) Comput. Methods Appl. Mech. Engrg , vol.141 , pp. 141-156
    • Spiliopoulos, K.V.1
  • 22
    • 0038722916 scopus 로고    scopus 로고
    • Minimum cycle bases of Halin graphs
    • [St]
    • [St] P.F. Stadler. Minimum cycle bases of Halin graphs. J. Graph Theory, 43:150-155, 2003.
    • (2003) J. Graph Theory , vol.43 , pp. 150-155
    • Stadler, P.F.1
  • 23
    • 0001790593 scopus 로고
    • Depth-first search and linear graph algorithms
    • [Ta]
    • [Ta] R. Tarjan. Depth-first search and linear graph algorithms. SIAM J. Comput., 1:146-160, 1972.
    • (1972) SIAM J. Comput. , vol.1 , pp. 146-160
    • Tarjan, R.1


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