<--- Back to Details
First PageDocument Content
Graph / Strongly connected component / Centrality / Butterfly graph / Extremal graph theory / Graph theory / Mathematics / Distance
Date: 2009-11-24 06:25:28
Graph
Strongly connected component
Centrality
Butterfly graph
Extremal graph theory
Graph theory
Mathematics
Distance

Microsoft Word - hw2_sampleanswer.doc

Add to Reading List

Source URL: www.cse.cuhk.edu.hk

Download Document from Source Website

File Size: 47,43 KB

Share Document on Facebook

Similar Documents

Graph theory / Graph / Matching / Graph coloring / Graph operations / Planar graphs / Strongly connected component

BR-Index: An Indexing Structure for Subgraph Matching in Large Dynamic Graphs Jiong Yang and Wei Jin EECS Department Case Western Reserve University

DocID: 1r7M1 - View Document

Graph theory / Graph connectivity / Cycle / Eulerian path / Topological sorting / Directed acyclic graph / Strongly connected component / Connected component / Directed graph / Graph / Cyclic graph / Depth-first search

Algorithms and Data Structures Winter TermExercises for UnitProve that the implementation for the DFS-framework presented in the lecture correctly identifies the strongly connected components in a directe

DocID: 1qy6z - View Document

Graph theory / Graph connectivity / Depth-first search / Cycle / Connected component / Graph / Strongly connected component / Ear decomposition / Tree / Bridge / Graph traversal

Basics DFS Framework Implementations

DocID: 1pQhY - View Document

Network theory / Edsger W. Dijkstra / Graph connectivity / Routing algorithms / Spanning tree / Graph / Shortest path problem / Strongly connected component / Cycle / Longest path problem / Connected component / FloydWarshall algorithm

November 18, Fall 2009 Quiz 2 Introduction to Algorithms Massachusetts Institute of Technology

DocID: 1mnjN - View Document

Graph theory / Graph connectivity / Search algorithms / Breadth-first search / Graph traversal / Spanning tree / Strongly connected component / Tree / Ear decomposition / Connected component / Graph coloring / Maximal independent set

Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search Scott Beamer EECS Department University of California Berkeley, California

DocID: 1kahG - View Document