메뉴 건너뛰기




Volumn 39, Issue 4, 1996, Pages 558-565

The minimum-weight ideal problem for signed posets

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0141980232     PISSN: 04534514     EISSN: None     Source Type: Journal    
DOI: 10.15807/jorsj.39.558     Document Type: Article
Times cited : (6)

References (19)
  • 2
    • 26944460823 scopus 로고
    • Report No. 93813, Forschungsinstitut für Diskrete Mathematik, Universität Bonn January
    • K. Ando and S. Fujishige: ∪, ∩-closed families and signed posets. Report No. 93813, Forschungsinstitut für Diskrete Mathematik, Universität Bonn (January 1994).
    • (1994) ∪, ∩-Closed Families and Signed Posets
    • Ando, K.1    Fujishige, S.2
  • 3
    • 0002471926 scopus 로고    scopus 로고
    • On structures of bisubmodular polyhedra
    • K. Ando and S. Fujishige: On structures of bisubmodular polyhedra. Mathematical Programming 74 (1996) 293-318.
    • (1996) Mathematical Programming , vol.74 , pp. 293-318
    • Ando, K.1    Fujishige, S.2
  • 4
    • 26944454434 scopus 로고    scopus 로고
    • A characterization of bisubmodular functions
    • K. Ando, S. Fujishige and T. Naitoh: A characterization of bisubmodular functions. Discrete Mathematics 148 (1996) 299-303.
    • (1996) Discrete Mathematics , vol.148 , pp. 299-303
    • Ando, K.1    Fujishige, S.2    Naitoh, T.3
  • 5
    • 0041439269 scopus 로고    scopus 로고
    • Decomposition of a bidirected graph into strongly connected components and its signed poset structure
    • K. Ando, S. Fujishige and T. Nemoto: Decomposition of a bidirected graph into strongly connected components and its signed poset structure. Discrete Applied Mathematics 68 (1996) 237-248.
    • (1996) Discrete Applied Mathematics , vol.68 , pp. 237-248
    • Ando, K.1    Fujishige, S.2    Nemoto, T.3
  • 9
    • 0003348586 scopus 로고
    • Matching: A well-solved class of linear programs
    • R. Guy, H. Hanani, N. Sauer and J. Schönheim, eds., Gordon and Breach, New York
    • J. Edmonds and E. L. Johnson: Matching: a well-solved class of linear programs. In: Combinatorial Structures and Their Applications (R. Guy, H. Hanani, N. Sauer and J. Schönheim, eds., Gordon and Breach, New York, 1970), pp. 88-92.
    • (1970) Combinatorial Structures and Their Applications , pp. 88-92
    • Edmonds, J.1    Johnson, E.L.2
  • 15
    • 0016972463 scopus 로고
    • Maximal closure of a graph and applications to combinatorial problems
    • J. C. Picard: Maximal closure of a graph and applications to combinatorial problems. Management Science 22 (1976) 1268-1272.
    • (1976) Management Science , vol.22 , pp. 1268-1272
    • Picard, J.C.1
  • 16
    • 0020208962 scopus 로고
    • Selected applications on minimum cuts in networks
    • J. C. Picard and M. Queyranne: Selected applications on minimum cuts in networks. INFOR 20 (1982) 394-422.
    • (1982) INFOR , vol.20 , pp. 394-422
    • Picard, J.C.1    Queyranne, M.2
  • 18
    • 0019897730 scopus 로고
    • Signed graphs
    • Erratum, ibid., 5 (1983) 248
    • T. Zaslavsky: Signed graphs. Discrete Applied Mathematics 4 (1982) 47-74. Erratum, ibid., 5 (1983) 248.
    • (1982) Discrete Applied Mathematics , vol.4 , pp. 47-74
    • Zaslavsky, T.1


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