Sciweavers

2487 search results - page 12 / 498
» Partitions of Graphs into Trees
Sort
View
SMI
2003
IEEE
188views Image Analysis» more  SMI 2003»
14 years 1 months ago
On Graph Partitioning, Spectral Analysis, and Digital Mesh Processing
Partitioning is a fundamental operation on graphs. In this paper we briefly review the basic concepts of graph partitioning and its relationship to digital mesh processing. We als...
Craig Gotsman
CASES
2010
ACM
13 years 6 months ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau
PPAM
2007
Springer
14 years 2 months ago
Application of Fusion-Fission to the Multi-way Graph Partitioning Problem
This paper presents an application of the Fusion-Fission method to the multi-way graph partitioning problem. The Fusion-Fission method was first designed to solve the normalized c...
Charles-Edmond Bichot
TOMS
2010
106views more  TOMS 2010»
13 years 6 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
UAI
2003
13 years 9 months ago
On Triangulating Dynamic Graphical Models
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
Jeff A. Bilmes, Chris Bartels