A Near-shortest Path Algorithm on Bounded-degree and Bounded-diameter Graphs

Thesis

Lee, Yen-Yu

Masters, 國立清華大學, 資訊工程學系所

2017

Abstract

最短路徑

小世界網路

shortest path

small-world networks

abstract hide

1 Record Views

Title: A Near-shortest Path Algorithm on Bounded-degree and Bounded-diameter Graphs
Translated title: A Near-shortest Path Algorithm on Bounded-degree and Bounded-diameter Graphs
Creators: Lee, Yen-Yu
Contributors: Tsai, Ming-Jer (Advisor)
Awarding Institution: 國立清華大學, 資訊工程學系所; Masters
Theses and Dissertations: Masters, 國立清華大學, 資訊工程學系所
Language: English
Resource Type: Thesis
Date published: 2017