On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint.
Patrick Ciarlet Jr.Françoise LamourPublished in: Numer. Algorithms (1996)
Keyphrases
- graph partitioning
- spectral graph
- temporal planning problems
- gaussian graphical models
- graph matching
- sparse data
- graph theoretic
- high dimensional
- sparsity constraints
- strongly connected
- graph structure
- partitioning algorithm
- pairwise
- topological properties
- compressive sensing
- graph mining
- graph theory
- sparse representation
- graph representation
- constraint networks
- graph model
- graph kernels
- shortest path
- directed acyclic
- graphical models
- feature selection