<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / Algebra / Algebraic graph theory / Matrices / NP-complete problems / Eigenvalues and eigenvectors / Linear algebra / Regular graph / Planar graph / Laplacian matrix / Adjacency matrix
Date: 2005-06-30 12:02:42
Graph theory
Mathematics
Algebra
Algebraic graph theory
Matrices
NP-complete problems
Eigenvalues and eigenvectors
Linear algebra
Regular graph
Planar graph
Laplacian matrix
Adjacency matrix

Specral Graph Theory and its Applications September 2, 2004 Lecture 1 Lecturer: Daniel A. Spielman

Add to Reading List

Source URL: www.cs.yale.edu

Download Document from Source Website

File Size: 821,58 KB

Share Document on Facebook

Similar Documents

Near-Optimal Compression for the Planar Graph Metric Amir Abboud∗ Paweł Gawrychowski†  Abstract

Near-Optimal Compression for the Planar Graph Metric Amir Abboud∗ Paweł Gawrychowski† Abstract

DocID: 1vkO7 - View Document

Computing the Girth of a Planar Graph in O(n log n) time Oren Weimann (Weizmann Institute of Science) Raphy Yuster (University of Haifa)

Computing the Girth of a Planar Graph in O(n log n) time Oren Weimann (Weizmann Institute of Science) Raphy Yuster (University of Haifa)

DocID: 1v2rQ - View Document

UNDER REVIEW, Gracker: A Graph-based Planar Object Tracker Tao Wang and Haibin Ling

UNDER REVIEW, Gracker: A Graph-based Planar Object Tracker Tao Wang and Haibin Ling

DocID: 1uoNh - View Document

The random planar graph process Stefanie Gerke ∗  Dirk Schlatter

The random planar graph process Stefanie Gerke ∗ Dirk Schlatter

DocID: 1tk3p - View Document

Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved

Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved

DocID: 1rtvU - View Document