Allocating time to Instructors

Slides:

Advertisements

Similar presentations

Chapter 9 Graphs.

Advertisements

22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.

22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.

13 May 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.

Friendly Partitions of Graphs Jenna Huston Advised by Dr. David Offner.

Structured Graphs and Applications

Last time: terminology reminder w Simple graph Vertex = node Edge Degree Weight Neighbours Complete Dual Bipartite Planar Cycle Tree Path Circuit Components.

GSM MOBILE PHONE NETWORKS AND GRAPH COLORING

1 Section 8.2 Graph Terminology. 2 Terms related to undirected graphs Adjacent: 2 vertices u & v in an undirected graph G are adjacent (neighbors) in.

Section 2.3 Graph Coloring By Katie Lessard & Colleen Raimondi.

Graph Colouring Lecture 20: Nov 25.

K-Coloring k-coloring: A k-coloring of a graph G is a labeling f: V(G)  S, where |S|=k. The labels are colors; the vertices of one color form a color.

Problem: Induced Planar Graphs Tim Hayes Mentor: Dr. Fiorini.

MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 10, Monday, September 22.

K-Coloring k-coloring: A k-coloring of a graph G is a labeling f: V(G)  S, where |S|=k. The labels are colors; the vertices of one color form a color.

Problem: Induced Planar Graphs Tim Hayes Mentor: Dr. Fiorini.

22C:19 Discrete Math Graphs Spring 2014 Sukumar Ghosh.

Graph Coloring.

CS 2813 Discrete Structures

9.8 Graph Coloring. Coloring Goal: Pick as few colors as possible so that two adjacent regions never have the same color. See handout.

9.2 Graph Terminology and Special Types Graphs

Lecture 10: Graphs Graph Terminology Special Types of Graphs

ساختمانهای گسسته دانشگاه صنعتی شاهرود – فروردین 1392.

1 CS104 : Discrete Structures Chapter V Graph Theory.

9.1 Introduction to Graphs

The Tutte Polynomial Graph Polynomials winter 05/06.

 2. Region(face) colourings  Definitions 46: A edge of the graph is called a bridge, if the edge is not in any circuit. A connected planar graph is called.

1 Graph Coloring: An Overview Graph Coloring Basics Planar/4-color Graphs Applications New Register Allocation Technique.

Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Introduction Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering,

Graph Colouring L09: Oct 10. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including the famous.

1 12/2/2015 MATH 224 – Discrete Mathematics Formally a graph is just a collection of unordered or ordered pairs, where for example, if {a,b} G if a, b.

Sec. 5.1: Planarity & Coloring

ساختمانهای گسسته دانشگاه صنعتی شاهرود – فروردین 1392.

1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.

Graph Colouring Lecture 20: Nov 25. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including.

Graph Theory and Applications

Graphs and 2-Way Bounding Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois 1 /File:7_bridgesID.png.

Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.

GRAPHS. Graph Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component, spanning tree Types of graphs: undirected,

Lecture 16: Graph Theory III Discrete Mathematical Structures: Theory and Applications.

Introduction to Graph Theory

Graph Theory Unit: 4.

Introduction to Graph Theory By: Arun Kumar (Asst. Professor) (Asst. Professor)

BY Abilash Choudary Sukhavasi 1. Agenda Real World Scenario Objective of the Study Proposed Solution Planar Graph Graph Coloring Chromatic Number Applying.

A problem with train tracks and interval graphs PRESENTED BY MANVITHA NELLORE.

Timetable Problem solving using Graph Coloring

Graph Coloring.

Graph Coloring Lots of application – be it mapping routes, coloring graphs, building redundant systems, mapping genes, looking at traffic patterns (see.

Applied Discrete Mathematics Week 13: Graphs

Proof technique (pigeonhole principle)

5.9.2 Characterizations of Planar Graphs

Chapter 5 Fundamental Concept

Graph theory Definitions Trees, cycles, directed graphs.

What is the next line of the proof?

Tucker, Applied Combinatorics, Sec 2.4

Graph Theory Graph Colorings.

Chapter 10.8 Graph Coloring

Chapter 10.8 Graph Coloring

Chapter 10.8 Graph Coloring

Graph Coloring.

Chapter 10.8 Graph Coloring

Lecture 10: Graphs Graph Terminology Special Types of Graphs

N(S) ={vV|uS,{u,v}E(G)}

Bipartite graphs and Planar Graphs

HW 3 (Due Wednesday Feb 6) Create slide(s) for your 1 minute presentation on a graph theory application. Make sure your slide(s) include (1) Define the.

Introduction to Graph Theory

Richard Anderson Lecture 5 Graph Theory

Chromatic Number of the Odd-Distance Graph

Concepts of Computation

Presentation transcript:

Allocating time to Instructors Presented by Gayatri Kakumanu

Outline: Problem Bipartite Graph Graph Colouring Solving Complication References

Problem: In an university there are m number of professors and n number of subjects. The university administration is facing problem to allocate these m number of professors to the minimum number of periods for teaching there subjects.

Bipartite Graph: This Bipartite graph is a graph whose vertices can be divided into two disjoint sets u and v such that every edge connects a vertex in u to one in v, that is u and v are independent sets. A complete bipartite graph with m-5, n-3

Properties: All acyclic graphs are bipartite(tree). A graph is bipartite if and only if it does not contain an odd cycle. Every subgraph H of a bipartite graph G is, itself, bipartite. A graph is bipartite if and only if it is 2-colorable, (i.e. its chromatic number is less than or equal to 2).

Graph Colouring: Graphs are used to depict “What is in conflict with what”, and colours are used to denote the state of vertex. So more precisely, colouring theory of “partitioning the sets having internal unrecognisable conflicts”

Terminology: Vertex Colouring: It is a way of colouring the vertices of a graph such that no two adjacent vertices share the same colour.

Edge Colouring: An edge colouring assigns a colour to each edge so that no two adjacent edges share same colour

Face Colouring: A face colouring of a planar graph assigns a colour to each face or region so that no two faces that share a boundary have the same colour

Chromatic Number: The chromatic number of a graph is the minimum number of colors in a proper coloring of that graph. If chromatic number is r then the graph is r-chromatic. Chromatic number: 4

Solving Complication: Let us consider that there are m1,m2,……mk number of professors and n1,n2,…..nm number of subjects as vertices of a bipartite graph and they are connected with pi periods as edges.

If we consider teaching requirement p=[pij] matrix taking m1,m2,m3,m4 professors and n1 to n5 5 subjects to be taught Pij= 0 1 1 0 0 1 0 1 0 0 1 1 1 1 0 0 0 1 1

Bipartite graph for the given matrix or timings

Now edge colouring is done so that no two adjacent edges have same colour

Then the timetable without any conflicts based on vertex minimum colouring will become Period 1 Period 2 Period 3 Period 4 Professor 1 N1 N3 N4 Professor 2 N2 Professor 3 Professor 4 N5

References Wikipedia https://en.wikipedia.org/wiki/Bipartite_graph https://en.wikipedia.org/wiki/Graph_coloring Academia https://www.academia.edu/2479839/Applications_of_Graph_Coloring_in_Modern_Computer_Science