Trees Kun-Mao Chao (趙坤茂)

Slides:

Advertisements

Similar presentations

The swap edges of a multiple source routing tree * 樹德資工 † 台大資工 Bang Ye Wu* Chih-Yuan Hsiao † Kun-Mao Chao †

Advertisements

Analysis & Design of Algorithms (CSCE 321)

Approximating the two-source minimum routing cost spanning trees Bang Ye Wu Shu-Te University.

Minimum Spanning Trees Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan

Midterm 2 Overview Fawzi Emad Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2009 Lecture 1 Introduction/Overview Text: Chapters 1, 2 Th. 9/3/2009.

1 Internet Networking Spring 2006 Tutorial 6 Network Cost of Minimum Spanning Tree.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Lecture 1 Introduction/Overview Wed. 9/5/01.

1 Internet Networking Spring 2004 Tutorial 6 Network Cost of Minimum Spanning Tree.

1 Internet Networking Spring 2002 Tutorial 6 Network Cost of Minimum Spanning Tree.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Spring, 2001 Lecture 1 Introduction/Overview Wed. 1/31/01.

Computer Math AP Computer Science Computer Programming.

A Topology-based ECO Routing Methodology for Mask Cost Minimization Po-Hsun Wu, Shang-Ya Bai, and Tsung-Yi Ho Department of Computer Science and Information.

Visibility Graphs and Motion Planning Kittiphan Techakittiroj for the Degree of Master of Science Department of Computer Science, Ball State University,

Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Cpt S 223 – Advanced Data Structures Graph Algorithms: Minimum.

Hon Wai Leong, NUS (CS6234, Spring 2009) Page 1 Copyright © 2009 by Leong Hon Wai CS6234 Lecture 1 -- (14-Jan-09) “Introduction”  Combinatorial Optimization.

ISE420 Algorithmic Operations Research Asst.Prof.Dr. Arslan M. Örnek Industrial Systems Engineering.

Counting Spanning Trees Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan

On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms National.

Course Introduction Software Engineering

Spring 2015 Mathematics in Management Science Network Problems Networks & Trees Minimum Networks Spanning Trees Minimum Spanning Trees.

Minimum Routing Cost Spanning Trees Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan.

1 Network Coding and its Applications in Communication Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.

Data Structures (Second Part) Lecture 1 Bong-Soo Sohn Assistant Professor School of Computer Science and Engineering Chung-Ang University.

Algorithms for Biological Sequence Analysis Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University,

1 BIM304: Algorithm Design Time: Friday 9-12am Location: B4 Instructor: Cuneyt Akinlar Grading –2 Midterms – 20% and 30% respectively –Final – 30% –Projects.

Algorithms for Biological Sequence Analysis Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University,

1 Introduction to Software Engineering Wen-Yang Lin Dept. of Computer Science and Information Engineering National University of Kaohsiung February, 2007.

The Theory of Computation Kun-Mao Chao ( 趙坤茂 ) National Taiwan University

Trees Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan

Construction of Optimal Data Aggregation Trees for Wireless Sensor Networks Deying Li, Jiannong Cao, Ming Liu, and Yuan Zheng Computer Communications and.

Operating Systems Dr. Sadi Seker.

Lecture 1 Introduction/Overview Text: Chapters 1, 2 Wed. 1/28/04

COMPSCI 330 Design and Analysis of Algorithms

Online Courses A note given in BCC class on May 10, 2016

Introduction of ECE665 Computer Algorithms

Computer Science 102 Data Structures CSCI-UA

A note given in BCC class on March 15, 2016

Unweighted Shortest Path Neil Tang 3/11/2010

CS 3343: Analysis of Algorithms

Algorithms for Biological Sequence Analysis

OVERVIEW 1-st Midterm: 3 problems 2-nd Midterm 3 problems

MBEDDED SOFTWARE SYSTEMS Spring 2004 Spring 2004 Prof. Brian L. Evans

CS 3343: Analysis of Algorithms

Minimum Spanning Trees

CS 3343: Analysis of Algorithms

Shortest-Paths Trees Kun-Mao Chao (趙坤茂)

Cpt S 471/571: Computational Genomics

The Theory of Computation

26 July 2011 SC 611 Class 1.

Minimum Spanning Trees

Algorithm Design and Analysis

A p r o x i m a t n l g h s f e - u c D i s c r e t A p l d M a h m 1

ECE 780 A2 Traffic Engineering and Network Design Fall Term 2008

Weighted Graphs & Shortest Paths

Dijkstra’s Shortest Path Algorithm Neil Tang 3/2/2010

Building Windows Applications by Visual C++ and Homework #3 Assignment

The Theory of Computation

Space-Saving Strategies for Computing Δ-points

CSE 550 Computer Network Design

Minimum Spanning Trees

Space-Saving Strategies for Computing Δ-points

Space-Saving Strategies for Computing Δ-points

MAT 379 Computer Networking

Design and Analysis of Algorithms

Space-Saving Strategies for Computing Δ-points

Trees Kun-Mao Chao (趙坤茂)

Minimum Spanning Trees

Multiple Sequence Alignment

Dynamic Programming Kun-Mao Chao (趙坤茂)

Presentation transcript:

Trees Kun-Mao Chao (趙坤茂) Department of Computer Science and Information Engineering National Taiwan University, Taiwan E-mail: kmchao@csie.ntu.edu.tw WWW: http://www.csie.ntu.edu.tw/~kmchao

About this course Course: Special topics on graph algorithms We will mostly focus on those tree-related algorithmic problems and their applications. Spring semester, 2019 9:10 - 12:10 Tuesday, 105 CSIE Building. 3 credits Web site: http://www.csie.ntu.edu.tw/~kmchao/tree19spr

Outlines Counting spanning trees Minimum spanning trees Shortest-paths tree Minimum routing cost spanning trees Communication spanning trees Light approximate spanning trees Steiner minimal trees Diameters Swap edges Tree splitting Other advanced topics

Coursework: Two midterm exams (35% each) tentatively on Mar. 26, 2019 and May 14, 2019 Oral presentation or implementation of selected topics or papers (20%) Homework and class participation (10%)

Our book on spanning trees Spanning Trees and Optimization Problems, by Bang Ye Wu and Kun-Mao Chao (2004), Chapman & Hall/CRC Press, USA. Link to Amazon

Spanning Trees and Optimization Problems S T O P ! Trees Optimization Problems & B.Y. Wu and K.-M. Chao CRC press, 2004