Packing r-cliques in weighted chordal graphs

Annals of Operations Research

Volumn 138, Issue 1, 2005, Pages 179-187

  Hell, P ^a   Klein, S ^b   Nogueira, L T ^b   Protti, F ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Chordal graphs; Complementary slackness; Greedy algorithms; Linear programming duality; Min max theorems

Indexed keywords

EID: 24144448739     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-005-2452-3     Document Type: Article

References (12)

1. Brandstädt, A. (1996). "Partitions of Graphs Into One or Two Independent Sets and Cliques." Discrete Mathematics 152, 47-54.
2. Brandstädt, A. (1998). "The Complexity of Some Problems Related to Graph 3-Colorability." Discrete Applied Mathematics 89, 59-73.
3. Cameron, K. (1989). "Induced Matchings." Discrete Applied Mathematics 24, 97-102.
4. Farber, M. (1982). "Applications of Linear Programming Duality to Problems Involving Independence and Domination." Ph.D. Thesis, Rutgers University.
5. Feder, T., P. Hell, S. Klein, and R. Motwani. (1999). "Complexity of Graph Partition Problems." In F.W. Thatcher and R. E. Miller (eds.), Proceedings of the 31st Annual ACM Symposium on Theory of Computing - STOC'99. New York: Plenum Press, pp. 464-472.
6. Foldes, S. and P. Hammer. (1977). "Split Graphs." F. Hoffman et al. (eds.). Proc. 8th Southeastern Conf. on Combinatorics, Graph Theory and Computing, Louisiana State Univ., Baton Rouge, Louisiana, pp. 311-315.
7. Frank, A. (1976). "Some Polynomial Algorithms for Certain Graphs and Hypergraphs." In Proceeding 5th British Combin. Conf. Congressus Numerantium No. XV, Utilitas Math., Winnipeg.
8. Garey, M.R., D.S. Johnson, and L. Stockmeyer. (1976). "Some Simplified NP-Complete Graph Problems." Theoretical Computer Science 1, 237-267.
9. Golumbic, M.C. (1980). Algorithmic Graph Theory and Perfect Graphs. New York: Academic Press.
10. Hell, P., S. Klein, L.T. Nogueira, and F. Protti. (2004). "Partitioning Chordal Graphs into Independent Sets and Cliques." Discrete Applied Mathematics 141, 185-194.
11. Karp, R.M. (1972). "Reducibility Among Combinatorial Problems." In R.E. Milner and J.W. Thatcher (eds.), Complexity of Computer Computations. New York: Plenum Press, pp. 85-103.
12. Nogueira, L.T. (1999). "Grafos Split e Grafos Split Generalizados." Master Thesis, COPPE-Sistemas, Universidade Federal do Rio de Janeiro, Brazil, (In Portuguese).