메뉴 건너뛰기
Mathematical Programming
Volumn 105, Issue 2-3, 2006, Pages 329-344
A linear programming formulation for the maximum complete multipartite subgraph problem
Author keywords

Complete multipartite subgraph; Independence system; Integer linear programming
Indexed keywords

GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;
EID: 29044442522     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-005-0656-6     Document Type: Conference Paper
Times cited : (3)
References (11)
  • 1
    • 29044433645 scopus 로고
    • The maximum edge-weighted clique problem in complete multipartite graphs
    • Cameron, K.: The maximum edge-weighted clique problem in complete multipartite graphs. J. Combin. Math. Combin. Comput. 9, 33-37 (1991)
    • (1991) J. Combin. Math. Combin. Comput. , vol.9 , pp. 33-37
    • Cameron, K.1
  • 2
    • 29044437153 scopus 로고
    • Edge partitions of complete multipartite graphs into equal length circuits
    • Cockayne, E.J., Hartnell, B.L.: Edge partitions of complete multipartite graphs into equal length circuits. J. Combinatorial Theory Ser. B 23 (2-3) 174-183 (1977)
    • (1977) J. Combinatorial Theory Ser. B , vol.23 , Issue.2-3 , pp. 174-183
    • Cockayne, E.J.1    Hartnell, B.L.2
  • 3
    • 33644914697 scopus 로고    scopus 로고
    • Chromatic characterization of biclique covers
    • to appear
    • Cornaz, D., Fonlupt, J.: Chromatic characterization of biclique covers, to appear in Discrete Math.
    • Discrete Math
    • Cornaz, D.1    Fonlupt, J.2
  • 4
    • 0039355824 scopus 로고    scopus 로고
    • Bipartite dimensions and bipartite degrees of graphs
    • Fishburn, P.C., Hammer, P.L.: Bipartite dimensions and bipartite degrees of graphs. Discrete Math. 160, 127-148 (1996)
    • (1996) Discrete Math. , vol.160 , pp. 127-148
    • Fishburn, P.C.1    Hammer, P.L.2
  • 5
    • 0030530655 scopus 로고    scopus 로고
    • Sharp bounds for decompositions of graphs into complete r-partite subgraphs
    • Gregory, D.A., Vander, Meulen, K.N.: Sharp bounds for decompositions of graphs into complete r-partite subgraphs. J. Graph Theory 21 (4) 393-400 (1996)
    • (1996) J. Graph Theory , vol.21 , Issue.4 , pp. 393-400
    • Gregory, D.A.1    Vander Meulen, K.N.2
  • 6
    • 51249185617 scopus 로고
    • The ellipsoid method and its consequences in combinatorial optimization
    • Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 (2), 169-197 (1981)
    • (1981) Combinatorica , vol.1 , Issue.2 , pp. 169-197
    • Grötschel, M.1    Lovász, L.2    Schrijver, A.3
  • 7
    • 0346783009 scopus 로고
    • Cycle decompositions of complete and complete multipartite graphs
    • Ramirez-Alfonsín, J.L.: Cycle decompositions of complete and complete multipartite graphs. Australas. J. Combin. 11, 233-238 (1995)
    • (1995) Australas. J. Combin. , vol.11 , pp. 233-238
    • Ramirez-Alfonsín, J.L.1
  • 8
    • 0007202012 scopus 로고
    • A survey of clique and biclique coverings and factorizations of (0,1)-matrices
    • Monson S.D., Pullman N.J., Rees, R.: A survey of clique and biclique coverings and factorizations of (0,1)-matrices. Bulletin of the ICA 14.17-86 (1995)
    • (1995) Bulletin of the ICA 14.17-86
    • Monson, S.D.1    Pullman, N.J.2    Rees, R.3
  • 10
    • 0141998079 scopus 로고    scopus 로고
    • The maximum edge biclique problem is NP-complete
    • Peeters, R.: The maximum edge biclique problem is NP-complete. Discrete Applied Math. 131 (3), 651-654 (2003)
    • (2003) Discrete Applied Math. , vol.131 , Issue.3 , pp. 651-654
    • Peeters, R.1

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