2314 search results - page 33 / 463 » Minimal Partitions of a Graph |
114
Voted
EJC
2008
15 years 27 days ago
2008
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...
98
Voted
ALGORITHMICA
2004
15 years 21 days ago
2004
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...
124
click to vote
PADS
2004
ACM
15 years 6 months ago
2004
ACM
We investigated the benefit of exploiting the symmetries of graphs for partitioning. We represent the model to be simulated by a weighted graph. Graph symmetries are studied in th...
108
click to vote
ISSS
1996
IEEE
15 years 5 months ago
1996
IEEE
In this paper we present the problem of flow graph balancing for minimizingthe required memory bandwidth. Our goal is to minimize the required memory bandwidth within the given cy...
119
Voted
FSTTCS
2009
Springer
15 years 5 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...