The Havel-Hakimi Algorithm. Take as input a degree sequence S and determine if that sequence is graphical That is, can we produce a graph with that degree.

Slides:

Advertisements

Similar presentations

Simple Graph Warmup. Cycles in Simple Graphs A cycle in a simple graph is a sequence of vertices v 0, …, v n for some n>0, where v 0, ….v n-1 are distinct,

Advertisements

Every edge is in a red ellipse (the bags). The bags are connected in a tree. The bags an original vertex is part of are connected.

Table of Contents Solving Linear Inequalities Graphically It is assumed you already know how to solve linear inequalities algebraically. A inequality is.

1 Lecture 5 (part 2) Graphs II Euler and Hamiltonian Path / Circuit Reading: Epp Chp 11.2, 11.3.

Students observe how their (sun) shadow changes throughout the day and seasons. \ 90 o Me and My Shadow.

MCA 520: Graph Theory Instructor Neelima Gupta

What is the first line of the proof? a). Assume G has an Eulerian circuit. b). Assume every vertex has even degree. c). Let v be any vertex in G. d). Let.

CS 280 Data Structures Professor John Peterson. Big O Notation We use a mathematical notation called “Big O” to talk about the performance of an algorithm.

CTIS 154 Discrete Mathematics II1 8.2 Paths and Cycles Kadir A. Peker.

What is the next line of the proof? a). Assume the theorem holds for all graphs with k edges. b). Let G be a graph with k edges. c). Assume the theorem.

HAWKES LEARNING SYSTEMS math courseware specialists Copyright © 2011 Hawkes Learning Systems. All rights reserved. Hawkes Learning Systems: College Algebra.

Sample PowerPoint Presentation

Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.

MATHEMATICS INDUCTION AND BINOM THEOREM By : IRA KURNIAWATI, S.Si, M.Pd.

Coloring 3/16/121. Flight Gates flights need gates, but times overlap. how many gates needed? 3/16/122.

Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patterson and Hennessy Text.

Graphical Analysis of Motion.  First, it must be remembered that there are 3 different descriptions for motion  Constant position (at rest)  Constant.

Slide Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.

Interaction diagrams Sequence and collaboration diagrams.

7.1 Introduction to Graph Theory

Notes 2.4 –Real Zeros of Polynomial Functions

© Ronaldo Menezes, Florida Tech Fundamentals of Algorithmic Problem Solving  Algorithms are not answers to problems  They are specific instructions for.

Compound Inequalities “And” & “Or” Graphing Solutions.

Multiple Regression Petter Mostad Review: Simple linear regression We define a model where are independent (normally distributed) with equal.

LIST OF EXPERIMENTS USING TMS320C5X Study of various addressing modes of DSP using simple programming examples Sampling of input signal and display Implementation.

Intro to Planning Or, how to represent the planning problem in logic.

2.1 Systems of Equations Mr. Anderson Pre Calculus Falconer Central High School Falconer, NY.

Lecture 17: Trees and Networks I Discrete Mathematical Structures: Theory and Applications.

9.2 Compound Sentences Goal(s): Solve and Graph Conjunctions and Disjunctions.

Algorithms an Introduction. History This course was first taught in the late 1960s The main principals that maintained the area –Find algorithms that.

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

7 Finding Bridge in a Graph. What is a bridge ? A C D B F G E.

SCRATCH ScratchScratch is a programming language that makes it easy to create your own interactive stories, animations, games, music, and art -- and share.

What Does A Graph Do? A graph is a way in which to graphically show information. Graphs allow for easy comparison of multiple variables. There are many.

1 Chapter 9 Undecidability  Turing Machines Coded as Binary Strings  Universal Turing machine  Diagonalizing over Turing Machines  Problems as Languages.

EXAMPLE 1 Solve a system graphically Graph the linear system and estimate the solution. Then check the solution algebraically. 4x + y = 8 2x – 3y = 18.

Entry Task You are a passenger in a car. You are using a cell phone that connects with the tower shown. The tower has an effective range of 6 miles. If.

L ECTURE 3 T HEORY OF AUTOMATA. E QUIVALENT R EGULAR E XPRESSIONS Definition Two regular expressions are said to be equivalent if they generate the same.

 Each of these types of biomolecules are polymers that are assembled from single units called monomers.

Leda Demos By: Kelley Louie Credits: definitions from Algorithms Lectures and Discrete Mathematics with Algorithms by Albertson and Hutchinson graphics.

WARM UP What is a function. How are they used.. FUNCTIONS.

Data Structures.

Graphs Rosen, Chapter 8.

10.8 Systems of Second-Degree Equations and Inequalities

1.3 Graphs of Functions Pre-Calculus.

Convex Hull R.L. Graham’s Algorithm Computer Graphics.

מבני נתונים ויעילות אלגוריתמים

“Saving a life doesn’t have to involve bravery or a heroic act – it can be simple. Ordinary people save lives every day, by giving some of their time and.

CS223 Advanced Data Structures and Algorithms

Equations of Lines in Another Format

Degree Sequences & Digraphs

BugHint: A Visual Debugger Based on Graph Mining

Y The graph of a rule connecting x and y is shown. From the graph, when x is -1, what is y? Give me a value of x that makes y positive, negative, equal.

These are flips, slides, turns, and enlargements/reductions.

Section 8.3: Degree Distribution

Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.

Objective- To use an equation to graph the

Graphs G = (V, E) V are the vertices; E are the edges.

Lecture 6 Dynamic Programming

The connected word recognition problem Problem definition: Given a fluently spoken sequence of words, how can we determine the optimum match in terms.

EXPLICIT RULES: INPUT-OUTPUT FORMULAS

Chapter 3: Selection Structures: Making Decisions

Graph Theory: Degree Sequences and Digraphs

Lecture 28 Approximation of Set Cover

Expected outcomes Potential problems

Presentation transcript:

The Havel-Hakimi Algorithm

Take as input a degree sequence S and determine if that sequence is graphical That is, can we produce a graph with that degree sequence?

Assume the degree sequence is S Note: steps 1 and 2 are a pre-process

S = 4,3,3,3,1

S = 2,2,2,0

S = 4,3,3,3,1 S = 2,2,2,0S = 1,1,0

S = 4,3,3,3,1 S = 2,2,2,0S = 1,1,0S = 0,0

S = 4,3,3,3,1 S = 2,2,2,0S = 1,1,0Report Success

4,4,4,4,1,1,1,1,1,1,1,1,1,1

Alternatively 4,4,4,4,1,1,1,1,1,1,1,1,1,1

Havel-Hakimi produces the following 4,4,4,4,1,1,1,1,1,1,1,1,1,1 The hypothetical hydrocarbon Vinylacetylene

So? (the question from hell) Well, we have demonstrated that the HH algorithm doesnt always produce A connected graph. We have also shown that by representing molecules as simple graphs and using an algorithm to model this graph we might get some unexpected results, maybe something new!