<--- Back to Details
First PageDocument Content
Algebraic graph theory / Laplacian matrix / Eigenvalues and eigenvectors / Nested dissection / Vertex separator / Planar separator theorem / Adjacency matrix / Graph theory / Mathematics / Algebra
Date: 2011-12-04 14:11:43
Algebraic graph theory
Laplacian matrix
Eigenvalues and eigenvectors
Nested dissection
Vertex separator
Planar separator theorem
Adjacency matrix
Graph theory
Mathematics
Algebra

Partitioning Alex Sparse Pothen

Add to Reading List

Source URL: snap.stanford.edu

Download Document from Source Website

File Size: 1,68 MB

Share Document on Facebook

Similar Documents

Graph theory / NP-complete problems / Maximal independent set / Independent set / Dominating set / Vertex cover / Graph coloring / Planar graph / Graph minor / Planar separator theorem / Tree decomposition

Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p

DocID: 1r43q - View Document

Graph theory / Bipartite graphs / Tree / Chordal graph / Cycle / Graph coloring / Geometric group theory / Graph connectivity / Spectral theory of ordinary differential equations / Vertex separator

SIAM J. DISCRETE MATH. Vol. 29, No. 2, pp. 835–853 c 2015 Society for Industrial and Applied Mathematics 

DocID: 1qJx3 - View Document

Graph theory / Chordal graph / Chordal completion / Tree / Graph coloring / Graph connectivity / Treewidth / Vertex separator

Discrete Mathematics – 43 www.elsevier.com/locate/disc Identifying phylogenetic trees Magnus Bordewicha , Katharina T. Huberb , Charles Semplec a School of Computing, University of Leeds, Leeds LS2 9JT, U

DocID: 1qHsU - View Document

Graph theory / Mathematics / Discrete mathematics / 3D computer graphics / Vertex / Graph / Planar separator theorem / Line graph

SPATIAL OVERLAY WITH INEXACT NUMERICAL DATA David Pullar Surveying Engineering Department National Center for Geographical Information and Analysis University of Maine, Orono, Maine, U.S. A.

DocID: 1qBAK - View Document

Mathematics / Graph theory / Discrete mathematics / Search algorithms / Graph traversal / Breadth-first search / Vertex / Connectivity / Shortest path problem / Graph coloring / Planar separator theorem

Parallel Breadth First Search on GPU Clusters using MPI and GPUDirect Speaker: Harish Kumar Dasari, Scientific Computing and Imaging Institute, University of Utah Advisor: Dr. Martin Berzins, SCI, University of Utah

DocID: 1q6lo - View Document