2-Day Course Brochure (pre-Workshop Event)

Dates : 11 & 12 May 2015 (Monday & Tuesday).
Time : 9:00 a.m. – 5:00 p.m.
Venue : Kompleks ЄUREKA, Universiti Sains Malaysia, Penang.
WHO SHOULD ATTEND?
Lecturers, Researchers, Engineers, Students, Industry Professionals
and Scientists who wish to explore ideas on graph algorithms from
top experts in the field.
PUSAT PENGAJIAN SAINS KOMPUTER
SCHOOL OF COMPUTER SCIENCES
COURSE FEE
in collaboration with:
Fee inclusive of GST (GST registration no : 0012 9141 9648).
Fee covers tea breaks and lunches, course materials and Certificate of
Attendance.
MYR 950.00 per participant
(wholly-owned by Universiti Sains Malaysia)
(Co. No. 473883-H)
HRDF : 0159
GROUP: MYR 850.00 per participant
(Minimum 3 participants from the same company /
organisation)
HRDF Claimable*
*Subject to HRDF Approval
STUDENT: MYR 450.00 per participant
(Proof of I.D. is compulsory)
(No Group Discount available)
INTRODUCTION
Graph algorithms play an important role in
communication
networks,
data
organization,
computational devices, flow of computation, social
networks etc. Graphs, especially trees and binary
trees, are used in the representation of data
structures. Further graph theory finds applications in
economics,
logistics,
cybernetics,
artificial
intelligence, pattern recognition, reliability theory,
fault diagnosis in computers, switching and coding
theory, combinatorial operations research and so on.
Another major research area in graph theory is the
study of domination (more than 65 models have
been reported), with interesting applications in
various areas.
This course is a pre-workshop event of "International
Workshop on Graph Algorithms - IWGA2015".
You are also welcome to participate in IWGA2015
(13th May 2015).
Please visit http://event.cs.usm.my/IWGA2015/.
COURSE METHODOLOGY
The presenters would begin with certain real life
problems and puzzles to motivate graph notions with
intuitive examples. Then they would concentrate on
transforming real life problems to graph theoretic
problems. Methods and algorithms on graphs will be
discussed taking the participants to the frontiers of
various topics, including algorithmic aspects. The
presenters would strive to keep the delivery simple,
so that anyone interested can follow this course.
ENQUIRIES
Technical :
Dr. Ibrahim Venkat
School of Computer Sciences
Universiti Sains Malaysia, Penang.
(T) : +604 – 653 4753
(M) : +6017 – 531 0866
(E) : [email protected]
Registration and others:
Khairol Anuar Hazir Mohammed
USAINS Holding Sdn. Bhd.
(G) +604 – 643 7420 ext 5714
(DL) +604 – 653 5714 / (M) +6012-286 9048
(E) : [email protected] /
[email protected]
BIOGRAPHY OF THE PRESENTER
PROF. EMERITUS DR. BHARATI RAJAN
Prof. Emeritus Dr. Bharati Rajan
is a Conjoint Professor at The
Univ. of Newcastle, Australia and
an expert in graph algorithms.
She
has
visited
renowned
universities in Qatar, Kuwait,
Indonesia, Bangkok, Australia and
Czech
Republic
for
potential
research
collaboration.
She has guided several Ph.D research scholars on
topics including graph theory. She has to her credit
85 papers published in reputed journals and
conferences. She has edited special issues for
several reputed journals including Journal of
Discrete Algorithms, Intl. Journal of Mathematics
and Computer Science, Journal of Combinatorial
Mathematics and Combinatorial Computing.
PROFESSOR S. ARUMUGAM
Professor
S.
Arumugam
is
Director, National Centre for
Advanced Research in Discrete
Mathematics (n-CARDMATH) at
Kalasalingam University, South
India. He is the founder Editor-inChief of AKCE International
Journal of Graphs and Combinatorics (SCOPUS).
He is also a Conjoint Professor, at The University
of Newcastle, Australia and a Visiting Professor at
Liverpool Hope University, UK and Adjunct
Professor at Ball State University, USA. He has
authored around 25 text books and guided 35
Ph.D. candidates and has published around 185
papers in reputed journals.
Graph Algorithms and Its Industrial Applications – Tutorial and Case Studies
Course Contents and Tentative Schedule
DAY 1
TIME
9:30 – 10:30 a.m.
10:30 – 11:00 a.m.
11:00 a.m. – 12:30 p.m.
12:30 – 2:00 p.m.
2:00 – 3:30 p.m.
3:30 – 4:00 p.m.
4:00 – 5:00 p.m.
TOPIC
1.
Graph theory: An Introduction.
• Motivation and development of graph theory.
• Examples leading to different graphs.
• Real problems to graph problems.
Break
2.
Selected topics I.
• Dijkstra's shortest path algorithm.
• Cayley’s Formula.
• Connector problem and Kruskal’s algorithm.
• Chinese postman problem and Fleury’s algorithm.
Lunch
3.
Selected topics II.
• Travelling salesman problem and algorithm.
• Matching: The personnel assignment problem and algorithm.
• Coloring: Chromatic number and the 4-colour theorem.
Break
4.
Graph Classes: Illustrative examples.
• Interval graphs.
• Chordal graphs.
• Permutation graphs.
• Split graphs.
DAY 2
9:30 – 10:30 a.m.
10:30 – 11:00 a.m.
11:00 a.m. – 12:30 p.m.
12:30 – 2:00 p.m.
2:00 – 3:30 p.m.
3:30 – 4:00 p.m.
4:00 – 5:00 p.m.
5.
Graph exploration.
• Depth-First Search.
• Breadth-First Search.
Break
6.
Planarity.
• Planarity Algorithm.
• Crossing Number, page number and thickness.
Lunch
7.
Domination.
• Domination in graphs.
• Domination chain.
• Various types of domination.
Break
8.
Algorithmic Aspects.
• Applications to real life problems.
• Directions for research.
Disclaimer
The Organizer reserves the right to reschedule or cancel any part of its published programme or venue due to unforeseen circumstances and
will not accept liability for costs incurred by participants or their organizations for the cancellation of travel arrangements and/or accommodation
reservations because of the course being cancelled or postponed. Advance notice will be given if there is such a change or cancellation.
REGISTRATION FORM
Graph Algorithms and Its Industrial Applications –
Tutorial and Case Studies – May 2015
Send registration form to: Khairol Anuar, Usains Holding Sdn. Bhd., Level 2, Block C, [email protected],
No.10, Persiaran Bukit Jambul, 11900 Bayan Lepas, Penang.
Fax : +604 – 643 0490 or Email : [email protected] / [email protected]
NO.
PARTICIPANT NAME
POSITION & EMAIL
1.
2.
3.
4.
5.
Company:
Address:
Postcode:
Contact Person:
Tel No.:
Fax No.:
E-mail:
Mobile No:
MODE OF PAYMENT
I enclosed
NUMBER
BANK
NO. OF PARTICIPANT
Cheque
Normal
Bank Draft
Group
Money Order
Student
LO / PO
MYR
Total
Cheque / Bank Draft / Money Order / LO / PO must be made payable to ‘USAINS HOLDING SDN. BHD.’.
1. Bank Transfer [Please fax your Bank-in Slip (Print your name & details on the slip)].
Payee Name
Details
Name of Bank
Account Number
: USAINS Holding Sdn. Bhd.
: Graph Algorithms and Its Industrial Applications – Tutorial and Case Studies.
: CIMB Bank Berhad (USM Branch), Universiti Sains Malaysia, 11800 USM Penang.
: 800 – 381 – 7364
2. A Local Order (LO) or Purchase Order (PO) must be presented before the event.
The Organizer reserves the right to refrain a registered participant from taking part in the event if no proof of
payment can be presented. This only applies to registered participants who have NOT paid the registration fee
PRIOR to the event date.
3. Cancellation / Substitution
A refund less administration fee of MYR 250.00 will be given for cancellations received at least 10 working days
before the start date of the course. No refund will be made after this period. However, substitute participants are
welcome at no extra charge if a written notice of at least 5 working days before the event is given to the Organizer.