What makes equitable connected partition easy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5917 LNCS, Issue , 2009, Pages 122-133

  Enciso, Rosa ^a   Fellows, Michael R ^b   Guo, Jiong ^c   Kanj, Iyad ^d   Rosamond, Frances ^b   Suchý, Ondřej ^e  

^a University of Central Florida   (United States)

^b UNIVERSITY OF NEWCASTLE   (Australia)

^c FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^d DEPAUL UNIVERSITY   (United States)

^e CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

CARDINALITIES; DYNAMIC PROGRAMMING TECHNIQUES; EQUITABLE COLORING; FEEDBACK VERTEX SET; HARDNESS RESULT; INDEPENDENT SET; PARAMETERIZATIONS; PARAMETERIZED; PARAMETERIZED COMPLEXITY; PARTITION PROBLEM; PATHWIDTH; PLANAR GRAPH; SECONDARY MEASUREMENTS; SPANNING TREE; SUBGRAPHS; TREE-WIDTH; VERTEX COVER;

SYSTEMS ENGINEERING;

GRAPH THEORY;

EID: 72249094214     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11269-0_10     Document Type: Conference Paper

References (13)

1. Altman, M.: Is automation the answer? the computational complexity of automated redistricting. Rutgers Computer and Technology Law Journal 23, 81-142 (2007)
2. Chen, J., Kanj, I.A., Xia, G.: Improved parameterized upper bounds for vertex cover. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 238-249. Springer, Heidelberg (2006)
3. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
4. Dyer,M.E., Frieze, A.M.: A partitioning algorithm for minimum weighted euclidean matching. Inf. Process. Lett. 18(2), 59-62 (1984)
5. Estivill-Castro, V., Fellows, M.R., Langston, M.A., Rosamond, F.A.: FPT is PTime Extremal Structure I. In: Hajo Broersma, M.J., Szeider, S. (eds.) ACiD. Texts in Algorithmics, vol. 4, pp. 1-41. King's College, London (2005)
6. Fellows, M.R., Fomin, F.V., Lokshtanov, D., Rosamond, F.A., Saurabh, S., Szeider, S., Thomassen, C.: On the complexity of some colorful problems parameterized by treewidth. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) COCOA. LNCS, vol. 4616, pp. 366-377. Springer, Heidelberg (2007)
7. Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1), 53-61 (2009)
8. Fiala, J., Golovach, P.A., Kratochvíl, J.: Parameterized complexity of coloring problems: Treewidth versus vertex cover. In: Chen, J., Cooper, S.B. (eds.) TAMC 2009. LNCS, vol. 5532, pp. 221-230. Springer, Heidelberg (2009)
9. Frank, A., Tardos, É.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica 7(1), 49-65 (1987)
10. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
11. Ito, T., Goto, K., Zhou, X., Nishizeki, T.: Partitioning a multi-weighted graph to connected subgraphs of almost uniform size. IEICE Transactions 90-D(2), 449-456 (2007)
12. Ito, T., Zhou, X., Nishizeki, T.: Partitioning a weighted graph to connected subgraphs of almost uniform size. In: Hromkovicβ, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 365-376. Springer, Heidelberg (2004)
13. West, D.: Introduction to graph theory. Prentice Hall Inc., Upper Saddle River, NJ (1996)