Sciweavers

12 search results - page 1 / 3
» Decomposition of sparse graphs, with application to game col...
Sort
View
DM
2010
65views more  DM 2010»
13 years 5 months ago
Decomposition of sparse graphs, with application to game coloring number
Mickaël Montassier, Arnaud Pêcher, Andr...
DAM
2008
145views more  DAM 2008»
13 years 5 months ago
Graph coloring in the estimation of sparse derivative matrices: Instances and applications
We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned s...
Shahadat Hossain, Trond Steihaug
FCT
2003
Springer
13 years 10 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
ICASSP
2010
IEEE
13 years 5 months ago
Fast signal analysis and decomposition on graphs using the Sparse Matrix Transform
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...
Leonardo R. Bachega, Guangzhi Cao, Charles A. Boum...
ISCAPDCS
2004
13 years 6 months ago
Distributed Algorithms for DCOP: A Graphical-Game-Based Approach
This paper addresses the application of distributed constraint optimization problems (DCOPs) to large-scale dynamic environments. We introduce a decomposition of DCOP into a graph...
Rajiv T. Maheswaran, Jonathan P. Pearce, Milind Ta...