Minisymposium (ID: SS-SGT)
Structured Graph Theory
Organizers: Kathie Cameron and Chinh Hoang, WLU
Many problems that are NP-complete for arbitrary graphs can be solved in polynomial time when restricted to special classes of graphs. The polynomial-time algorithms typically exploit the structures of these graphs. In this session, we present recent results in this direction.
Please note the ID code assigned to your presentation (identical to the ID code of your accepted abstract). It is required for submitting your paper for the AMMCS-2013 Proceedings. Submission is not mandatory. All submitted papers will be refereed and only accepted papers will be published in the AMMCS-2013 Proceedings.
If you intend to submit your paper, please go to the AMMCS-2013 Proceedings Page. Follow exactly the Author Instructions accessible from that page.